Standardization and Böhm Trees for $\Lambda\mu$-Calculus

Alexis Saurin 1, 2
2 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00527926
Contributor : Alexis Saurin <>
Submitted on : Wednesday, October 20, 2010 - 4:02:51 PM
Last modification on : Friday, January 4, 2019 - 5:33:25 PM

Links full text

Identifiers

Collections

Citation

Alexis Saurin. Standardization and Böhm Trees for $\Lambda\mu$-Calculus. Tenth International Symposium on Functional and Logic Programming - FLOPS 2010, Apr 2010, Sendai, Japan. pp.134-149, ⟨10.1007/978-3-642-12251-4_11⟩. ⟨hal-00527926⟩

Share

Metrics

Record views

377