Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. (English)
Inf. Comput. 208, No. 3, 276-291 (2010).
1
Strong normalization in a non-deterministic typed lambda-calculus. (English)
Nerode, A. (ed.) et al., LFCS ’94, Logical foundations of computer science. 3rd International Symposium, St. Petersburg, Russia, July 11-14, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 813, 142-152 (1994).
2
The lazy lambda calculus in a concurrency scenario. (English)
Inf. Comput. 111, No.1, 120-153 (1994).
3
Start
Contact
Print
General Help
