Strong Normalization for System F by HOAS on Top of FOAS
We present a point of view concerning HOAS(Higher-Order Abstract Syntax) and an extensive exercise in HOAS along this point of view. The point of view is that HOAS can be soundly and fruitfully regarded as a definitional extension on top of FOAS (First-Order Abstract Syntax). As such, HOAS is not on...
Saved in:
Published in | 2010 25th Annual IEEE Symposium on Logic in Computer Science pp. 31 - 40 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.07.2010
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We present a point of view concerning HOAS(Higher-Order Abstract Syntax) and an extensive exercise in HOAS along this point of view. The point of view is that HOAS can be soundly and fruitfully regarded as a definitional extension on top of FOAS (First-Order Abstract Syntax). As such, HOAS is not only an encoding technique, but also a higher-order view of a first-order reality. A rich collection of concepts and proof principles is developed inside the standard mathematical universe to give technical life to this point of view. The exercise consists of a new proof of Strong Normalization for System F. The concepts and results presented here have been formalized in the theorem prover Isabelle/HOL. |
---|---|
ISBN: | 9781424475889 1424475880 |
ISSN: | 1043-6871 2575-5528 |
DOI: | 10.1109/LICS.2010.48 |