Parametricity and Dependent Types

Bernardy, Jean-Philippe,1978Chalmers tekniska högskola,Chalmers University of Technology (författare)

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.

Jansson, Patrik,1972Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)patrikj (författare)
Paterson, Ross (författare)
Chalmers tekniska högskola (creator_code:org_t)

Ingår i:SIGPLAN Notices (ACM Special Interest Group on Programming Languages): Association for Computing Machinery (ACM)45:9, s. 345-3560730-85660362-13401558-1160

Av författaren/redakt...: Bernardy, Jean-P ...; Jansson, Patrik, ...; Paterson, Ross

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.