Sökning: onr:"swepub:oai:research.chalmers.se:94d8d251-423c-485e-94c3-e217d5bf0015" >
Parametricity and D...
Parametricity and Dependent Types
-
- Bernardy, Jean-Philippe, 1978 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Jansson, Patrik, 1972 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
Paterson, Ross (författare)
-
(creator_code:org_t)
- 2010-09-27
- 2010
- Engelska.
-
Ingår i: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). - : Association for Computing Machinery (ACM). - 0730-8566 .- 0362-1340 .- 1558-1160. ; 45:9, s. 345-356
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
http://publications....
-
https://doi.org/10.1...
-
https://research.cha...
-
visa färre...
Abstract
Ämnesord
Stäng
- Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. We (in second order predicate logic) about inhabitants of the type. We obtain a similar result for a single lambda calculus (a pure type system), in which terms, types and their relations are expressed. Working within a single system dispenses with the need for an interpretation layer, allowing for an unusually simple presentation. While the unification puts some constraints on the type system (which we spell out), the result applies to many interesting cases, including dependently-typed ones.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas