Article

Eta-Expansions in Dependent Type Theory - The Calculus of Constructions

Author:

Neil GhaniAuthors Info & Claims

TLCA '97: Proceedings of the Third International Conference on Typed Lambda Calculi and Applications

Pages 164 - 180

Published: 02 April 1997 Publication History

Abstract

No abstract available.

Cited By

View all

Jay BPeyton Jones S(2008)Scrap Your Type ApplicationsProceedings of the 9th international conference on Mathematics of Program Construction10.1007/978-3-540-70594-9_2(2-27)Online publication date: 15-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70594-9_2
Goguen H(2005)A syntactic approach to eta equality in type theoryACM SIGPLAN Notices10.1145/1047659.104031240:1(75-84)Online publication date: 12-Jan-2005
https://dl.acm.org/doi/10.1145/1047659.1040312
Harper RPfenning F(2005)On equivalence and canonical forms in the LF type theoryACM Transactions on Computational Logic (TOCL)10.1145/1042038.10420416:1(61-101)Online publication date: 1-Jan-2005
https://dl.acm.org/doi/10.1145/1042038.1042041
Show More Cited By

Index Terms

Eta-Expansions in Dependent Type Theory - The Calculus of Constructions
1. Theory of computation

Index terms have been assigned to the content through auto-classification.

Recommendations

Parametric quantifiers for dependent type theory

Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions cannot inspect their type argument and will therefore apply the same algorithm to any type they are instantiated on. This idea is formalized mathematically ...
Partial Gradual Dependent Type Theory
SPLASH 2023: Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity

Gradual typing supports imprecise types in the type system, allowing incremental migration from untyped code to typed in the same language. Through the gradual typing approach, our ongoing work proposes a new theory based on the Martin-Löf type theory ...
A relationally parametric model of dependent type theory
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Reynolds' theory of relational parametricity captures the invariance of polymorphically typed programs under change of data representation. Reynolds' original work exploited the typing discipline of the polymorphically typed lambda-calculus System F, ...

Comments

Information & Contributors

Information

Published In

TLCA '97: Proceedings of the Third International Conference on Typed Lambda Calculi and Applications

April 1997

404 pages

ISBN:3540626883

Editor:
Philippe de Groote

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 02 April 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jay BPeyton Jones S(2008)Scrap Your Type ApplicationsProceedings of the 9th international conference on Mathematics of Program Construction10.1007/978-3-540-70594-9_2(2-27)Online publication date: 15-Jul-2008
https://dl.acm.org/doi/10.1007/978-3-540-70594-9_2
Goguen H(2005)A syntactic approach to eta equality in type theoryACM SIGPLAN Notices10.1145/1047659.104031240:1(75-84)Online publication date: 12-Jan-2005
https://dl.acm.org/doi/10.1145/1047659.1040312
Harper RPfenning F(2005)On equivalence and canonical forms in the LF type theoryACM Transactions on Computational Logic (TOCL)10.1145/1042038.10420416:1(61-101)Online publication date: 1-Jan-2005
https://dl.acm.org/doi/10.1145/1042038.1042041
Goguen HPalsberg JAbadi M(2005)A syntactic approach to eta equality in type theoryProceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1040305.1040312(75-84)Online publication date: 12-Jan-2005
https://dl.acm.org/doi/10.1145/1040305.1040312
Pfenning F(2001)Logical frameworksHandbook of automated reasoning10.5555/778522.778526(1063-1147)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.5555/778522.778526
Barthe GHatcliff JSørensen M(2001)An induction principle for pure type systemsTheoretical Computer Science10.1016/S0304-3975(00)00373-X266:1-2(773-818)Online publication date: 6-Sep-2001
https://dl.acm.org/doi/10.1016/S0304-3975%2800%2900373-X

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Parametric quantifiers for dependent type theory

Partial Gradual Dependent Type Theory

A relationally parametric model of dependent type theory

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations