A Simple Take on Typed Abstract Syntax in Haskell-like Languages

Authors:
Olivier Danvy;Morten Rhiger
Affiliations:
-;-
Venue:
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Year:
2001

Citing 7
Cited 0

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Encoding types in ML-like languages

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Revised5 report on the algorithmic language scheme

ACM SIGPLAN Notices
The Definition of Standard ML

The Definition of Standard ML
Type-Directed Partial Evaluation

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
A Semantic Account of Type-Directed Partial Evaluation

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple way to program typed abstract syntax in a language following a Hindley-Milner typing discipline, such as Haskell and ML, and we apply it to automate two proofs about normalization functions as embodied in type-directed partial evaluation for the simply typed lambda calculus: normalization functions (1) preserve types and (2) yield long beta-eta normal forms.