Normalization by Evaluation for Typed Lambda Calculus with Coproducts

Authors:
T. Altenkirch;P. Dybjer;M. Hofmannz;P. Scott
Affiliations:
-;-;-;-
Venue:
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Year:
2001

Citing 0
Cited 22

A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

Theoretical Computer Science
Semantic analysis of normalisation by evaluation for typed lambda calculus

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Memoization in Type-Directed Partial Evaluation

GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Normalization and Partial Evaluation

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
A symmetric approach to compilation and decompilation

The essence of computation
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strong normalisation in the π-calculus

Information and Computation
A Local Graph-rewriting System for Deciding Equality in Sum-product Theories

Electronic Notes in Theoretical Computer Science (ENTCS)
A Characterisation of Lambda Definability with Sums Via T T-Closure Operators

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Weak βη -Normalization and Normalization by Evaluation for System F

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)
Hoare type theory, polymorphism and separation1

Journal of Functional Programming
Big-step normalisation

Journal of Functional Programming
A PVS Theory for Term Rewriting Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Extensional rewriting with sums

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Simple types in type theory: deep and shallow encodings

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Typed applicative structures and normalization by evaluation for system Fω

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A Formalization of the Knuth---Bendix(---Huet) Critical Pair Theorem

Journal of Automated Reasoning
Logic and computation in a lambda calculus with intersection and union types

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Conversion by evaluation

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Tait in one big step

MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Normalization by Evaluation and Algebraic Effects

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: We solve the decision problem for simply typed lambda calculus with strong binary sums, equivalently the word problem for free cartesian closed categories with binary coproducts. Our method is based on the semantical technique known as "normalization by evaluation" and involves inverting the interpretation of the syntax into a suitable sheaf model and from this extracting appropriate unique normal forms. There is no rewriting theory involved, and the proof is completely constructive, allowing program extraction from the proof.