Research topics in functional programming
Non-determinism in functional languages
The Computer Journal - Special issue on formal methods: part 1
The expressive power of indeterminate dataflow primitives
Information and Computation
The lazy Lambda calculus in a concurrency scenario
Information and Computation
Proving congruence of bisimulation in functional programming languages
Information and Computation
Relational reasoning about contexts
Higher order operational techniques in semantics
Computations, Residuals, and the POwer of Indeterminancy
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
McCarthy's Amb Cannot Implement Fair Merge
Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
Expressing and Reasoning About Non-Deterministic Functional Programs
Proceedings of the 1989 Glasgow Workshop on Functional Programming
Implementing Declarative Parallel Bottom-Avoiding Choice
SBAC-PAD '02 Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing
Eager Normal Form Bisimulation
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Amb Breaks Well-Pointedness, Ground Amb Doesn't
Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematical Structures in Computer Science
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
Applicative bisimulations for delimited-control operators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Normal form bisimulations for delimited-control operators
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Typed normal form bisimulation
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.01 |
This paper presents co-inductive operational theories of program refinement and equivalence, called whnf similarity and whnf simulation equivalence, for the @l-calculus extended with McCarthy's ambiguous choice operator amb. The associated whnf simulation co-induction proof principle is useful for establishing non-trivial equivalences and refinement relationships between programs. Whnf similarity is a pre-congruence and whnf simulation equivalence is a congruence and a conservative extension of the Levy-Longo tree theory for the pure @l-calculus.