Matches in UGent Biblio for { <https://biblio.ugent.be/publication/2073319#aggregation> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- aggregation classification "C1".
- aggregation creator B41943.
- aggregation creator B41944.
- aggregation creator B41945.
- aggregation creator B41946.
- aggregation creator person.
- aggregation date "2012".
- aggregation format "application/pdf".
- aggregation hasFormat 2073319.bibtex.
- aggregation hasFormat 2073319.csv.
- aggregation hasFormat 2073319.dc.
- aggregation hasFormat 2073319.didl.
- aggregation hasFormat 2073319.doc.
- aggregation hasFormat 2073319.json.
- aggregation hasFormat 2073319.mets.
- aggregation hasFormat 2073319.mods.
- aggregation hasFormat 2073319.rdf.
- aggregation hasFormat 2073319.ris.
- aggregation hasFormat 2073319.txt.
- aggregation hasFormat 2073319.xls.
- aggregation hasFormat 2073319.yaml.
- aggregation isPartOf urn:isbn:9781450312059.
- aggregation language "eng".
- aggregation publisher "Association for Computing Machinery (ACM)".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Science General".
- aggregation title "The implicit calculus: a new foundation for generic programming".
- aggregation abstract "Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combine two features: 1) a special type of interfaces; and 2) implicit instantiation of implementations of those interfaces. Scala implicits are a GP language mechanism, inspired by type classes, that break with the tradition of coupling implicit instantiation with a special type of interface. Instead, implicits provide only implicit instantiation, which is generalized to work for any types. This turns out to be quite powerful and useful to address many limitations that show up in other GP mechanisms. This paper synthesizes the key ideas of implicits formally in a minimal and general core calculus called the implicit calculus, and it shows how to build source languages supporting implicit instantiation on top of it. A novelty of the calculus is its support for partial resolution and higher-order rules (a feature that has been proposed before, but was never formalized or implemented). Ultimately, the implicit calculus provides a formal model of implicits, which can be used by language designers to study and inform implementations of similar mechanisms in their own languages.".
- aggregation authorList BK105717.
- aggregation aggregates 2073323.
- aggregation isDescribedBy 2073319.
- aggregation similarTo LU-2073319.