A call-by-need lambda calculus
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
The call-by-need lambda calculus
Journal of Functional Programming
Lazy evaluation and delimited control
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Small-step and big-step semantics for call-by-need
Journal of Functional Programming
Classical call-by-need and duality
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Classical call-by-need sequent calculi: the unity of semantic artifacts
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |