Explicit Substitutions and Higher-Order Syntax (Extended Abstract) (2003)

View PDF

Download Links

by Neil Ghani , Tarmo Uustalu
Venue:in Proc. of 2nd ACM SIGPLAN Wksh. on Mechanized Reasoning about Languages with Variable Binding, MERLIN'03
Citations:6 - 4 self

Documents Related by Co-Citation

885 Efficiently computing static single assignment form and the control dependence graph – Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck - 1991
1093 Depth first search and linear graph algorithms – Robert Tarjan - 1972
150 Abstract syntax and variable binding – M Fiore, G Plotkin, D Turi - 1999
457 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
237 Categories for the working mathematician, volume 5 of Graduate Texts in Mathematics – Saunders Mac Lane - 1998
225 Locally presentable and accessible categories – J Adámek, J Rosický - 1994
320 Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem – N. G. De Bruijn - 1972
261 Combinatory Reduction Systems – J W Klop - 1980
184 Towards a practical programming language based on dependent type theory – Ulf Norell - 2007