Strong normalization for System F by HOAS on top of FOAS

Cached


by Andrei Popescu , Elsa L. Gunter , Christopher J. Osborn
Citations:1 - 0 self

Documents Related by Co-Citation

23 Inductive Families. Formal Aspects of Computing 6(4 – P Dybjer
2 Polytypic properties and proofs – W Verbruggen, E de Vries, A Hughes - 2009
44 Indexed Induction-Recursion – Peter Dybjer, Anton Setzer - 2001
20 Comparing Libraries for Generic Programming in Haskell – Alexey Rodriguez, Johan Jeuring, Patrik Jansson, Alex Gerdes, Oleg Kiselyov, Bruno C. d. S. Oliveira - 2008
43 Pure type systems formalized – James Mckinna, Robert Pollack - 1993
17 Scrap your Nameplate - Functional Pearl – James Cheney
41 Higher-order abstract syntax in Coq – Joëlle Despeyroux, Amy Felty, André Hirschowitz - 1995
16 Exploring the regular tree types – Peter Morris, Thorsten Altenkirch, Conor Mcbride - 2004
24 The Abella interactive theorem prover (system description – Andrew Gacek - 2008
12 LNgen: Tool Support for Locally Nameless Representations – Brian Aydemir, Stephanie Weirich
17 A Universe of Binding and Computation – Daniel R. Licata, Robert Harper
696 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
69 Types for Modules – Claudio V. Russo - 1998
141 Intuitionistic type theory. Bibliopolis – P Martin-Löf - 1984
77 Monadic Presentations of Lambda Terms Using Generalized Inductive Types – Thorsten Altenkirch, Bernhard Reus - 1999
42 A certified type-preserving compiler from lambda calculus to assembly language – Adam Chlipala - 2007
42 Ott: Effective tool support for the working semanticist – Peter Sewell, Francesco Zappa Nardelli , Scott Owens, Gilles Peskine, Thomas Ridge, Susmit Sarkar, Rok Strnisa - 2007
5 Abstracting syntax – Brian Aydemir, Stephanie Weirich, Steve Zdancewic - 2009
260 Programming in Martin-Löf’s Type Theory. An Introduction – B Nordström, K Petersson, J M Smith - 1990