A formalization of the strong normalization proof for System F in LEGO
- 25 January 2006
- book chapter
- Published by Springer Nature
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Inductively defined typesLecture Notes in Computer Science, 1990
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972