Affiliation:
1. Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden
2. City University, London, United Kingdom
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference34 articles.
1. Universes for generic programs and proofs in dependent type theory;Benke M.;Nordic J. of Computing,2003
2. }}J.-P. Bernardy. A proof of the abstraction theorem for pure type systems (unary case). http://www.cse.chalmers.se/~bernardy/ParDep/html/Theorem.html 2010. }}J.-P. Bernardy. A proof of the abstraction theorem for pure type systems (unary case). http://www.cse.chalmers.se/~bernardy/ParDep/html/Theorem.html 2010.
3. Testing Polymorphic Properties
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Interpretation of E-HA^w inside HA^w;Electronic Proceedings in Theoretical Computer Science;2023-11-17
2. Internal Parametricity for Cubical Type Theory;Logical Methods in Computer Science;2021-11-03
3. SIGNATURES AND INDUCTION PRINCIPLES FOR HIGHER INDUCTIVE-INDUCTIVE TYPES;LOG METH COMPUT SCI;2020
4. Type-theory in color;ACM SIGPLAN Notices;2013-11-12
5. Logical relations for a logical framework;ACM Transactions on Computational Logic;2013-11