Normalisation by Evaluation

Authors:
Ulrich Berger;Matthias Eberl;Helmut Schwichtenberg
Affiliations:
-;-;-
Venue:
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Year:
1998

Citing 6
Cited 20

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Pragmatics of Type-Directed Partial Evaluation

Selected Papers from the Internaltional Seminar on Partial Evaluation
Categorical Reconstruction of a Reduction Free Normalization Proof

CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
Normalization and the Yoneda embedding

Mathematical Structures in Computer Science
Intuitionistic model constructions and normalization proofs

Mathematical Structures in Computer Science

Memoization in Type-Directed Partial Evaluation

GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Term rewriting for normalization by evaluation

Information and Computation - Special issue: ICC '99
A symmetric approach to compilation and decompilation

The essence of computation
Normalization by evaluation with typed abstract syntax

Journal of Functional Programming
Operational aspects of untyped Normalisation by Evaluation

Mathematical Structures in Computer Science
Synthesis of Moduli of Uniform Continuity by the Monotone Dialectica Interpretation in the Proof-system MinLog

Electronic Notes in Theoretical Computer Science (ENTCS)
Light Dialectica Program Extraction from a Classical Fibonacci Proof

Electronic Notes in Theoretical Computer Science (ENTCS)
A Compiled Implementation of Normalization by Evaluation

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Unembedding domain-specific languages

Proceedings of the 2nd ACM SIGPLAN symposium on Haskell
Normalization by evaluation for the computational lambda-calculus

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A new one-pass transformation into monadic normal form

CC'03 Proceedings of the 12th international conference on Compiler construction
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
Experimenting with deduction modulo

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Conversion by evaluation

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Internal normalization, compilation and decompilation for system Fβη

FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Internal models of system F for decompilation

Theoretical Computer Science
Discrete generalised polynomial functors

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A programming tutor for haskell

CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend normalization by evaluation (FIrst presented in [4]) from the pure typed 驴-calculus to general higher type term rewrite systems. This work also gives a theoretical explanation of the normalization algorithm implemented in the Minlog system.