- The Benefit of Being Non-Lazy in Probabilistic łambda-Calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name Gianluca Curzi Michele Pagani Sat 04 July 2020
- ML, Visibly Pushdown Class Memory Automata, and Extended Branching Vector Addition Systems with States Conrad Cotton-Barratt Andrzej S. Murawski C.-H. Luke Ong Sat 17 August 2019
- Finitary PCF is not decidable Ralph Loader Mon 18 February 2013
- On Full Abstraction for PCF: I, II, and III J.M.E. Hyland C.-H.L. Ong Tue 29 January 2013
- Fully abstract models of typed lambda-calculi Robin Milner Thu 12 April 2012
- LCF considered as a programming language Gordon Plotkin Tue 06 March 2012
Library Size: 13G (6 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
