How to replace failure by a list of successes
Proc. of a conference on Functional programming languages and computer architecture
Abstract continuations: a mathematical semantics for handling full jumps
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Notions of computation and monads
Information and Computation
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Total correctness by local improvement in the transformation of functional programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Foundations of programming languages
Foundations of programming languages
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Proceedings of the 1999 international conference on Logic programming
Deriving backtracking monad transformers
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs
Final data type specifications: a new data type specification method
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A unifying approach to goal-directed evaluation
New Generation Computing - Partial evaluation and program transformation
From control effects to typed continuation passing
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Design of a Pretty-printing Library
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
On the static and dynamic extents of delimited continuations
Science of Computer Programming
Inductive reasoning about effectful data types
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lazy evaluation and delimited control
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algebras for combinatorial search
Journal of Functional Programming
Embedded Probabilistic Programming
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Programming with multiple paradigms in lua
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Algebras for combinatorial search
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Kan extensions for program optimisation or: art and dan explain an old trick
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
A structural soundness proof for shivers's escape technique: a case for galois connections
SAS'12 Proceedings of the 19th international conference on Static Analysis
| Hi-index | 0.00 |
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate higher-order values and infinite computations. We also provide an operational semantics, and we prove it adequate for both models.