Rewriting with extensional polymorphic λ-calculus (original) (raw)
Related papers
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
Sigplan Notices, 2004
1993
λ-Types on the λ-Calculus with Abbreviations
Lambda Calculus and Intuitionistic Linear Logic
Studia Logica - An International Journal for Symbolic Logic, 1997
Confluence via strong normalisation in an algebraic λ-calculus with rewriting
Electronic Proceedings in Theoretical Computer Science, 2012
A semantic characterization of the well-typed formulae of λ-calculus
Theoretical Computer Science, 1993
J-Calc: A typed lambda calculus for Intuitionistic Justification Logic
Special Issue Workshop on Intuitionistic Modal Logic and Applications 2013
The Semantics of Second-Order Lambda Calculus
Information and Computation/information and Control, 1990
Normalization by evaluation for typed lambda calculus with coproducts
Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 2001
Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
Automata, Languages and Programming, 1994
Strong Normalization of the Typed λ ws -Calculus
Lecture Notes in Computer Science, 2003
The intensional lambda calculus
2007
Formalisation in Constructive Type Theory of Stoughton’s Substitution for the Lambda Calculus
Álvaro Tasistro, Ernesto Sebastián Copello Gigirey, Nora Szasz
Electronic Notes in Theoretical Computer Science, 2015
The genericity theorem and parametricity in the polymorphic λ-calculus
Theoretical computer science, 1993
A typed lambda calculus with categorical type constructors
Lecture Notes in Computer Science, 1987
Archive for Mathematical Logic, 2003
Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Ω-Rule
2016
Combining algebraic rewriting, extensional lambda calculi, and fixpoints
Theoretical Computer Science, 1996
Mechanical procedure for proof construction via closed terms in typed λ calculus
Journal of Automated Reasoning, 1988
An Ideal Model for an Extended Lambda-Calculus with Refinement
1991
The typed polymorphic label-selective λ-calculus
Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94, 1994
A New Model Construction for the Polymorphic Lambda Calculus
Logic Programming and Automated Reasoning/Russian Conference on Logic Programming, 2000
From Semantics to Types: the Case of the Imperative λ -Calculus
2021
Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
Electronic Notes in Theoretical Computer Science, 2001
A confluent reduction for the λ-calculus with surjective pairing and terminal object
Journal of Functional Programming, 1996
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
Lecture Notes in Computer Science, 2007
Lambda types on the lambda calculus with abbreviations
ArXiv Computer Science e-prints, 2006
Type Assignment for the Computational lambda-Calculus
arXiv (Cornell University), 2019
Proving properties of typed lambda terms: Realizability, covers, and sheaves
Lecture Notes in Computer Science, 1993
Mechanical Procedure for Proof Construction via Closed Terms in Typed \lambda Calculus
Journal of Automated Reasoning - JAR, 1988
Some results on extensionality in lambda calculus
Annals of Pure and Applied Logic, 2005
2009