|
9
|
A Note on Logical Relations Between Semantics and Syntax
– Andrew Pitts
- 1997
|
|
27
|
Domains and Denotational Semantics: History, Accomplishments and Open Problems
– Marcelo Fiore, Achim Jung, Eugenio Moggi, Peter O'Hearn, Jon Riecke, Giuseppe Rosolini, Ian Stark
- 1996
|
|
127
|
Games and Full Abstraction for the Lazy lambda-calculus
– Samson Abramsky, Guy Mccusker
- 1995
|
|
7
|
Relating Operational and Denotational Semantics for Input/Output Effects
– Roy L. Crole, Andrew D. Gordon
- 1999
|
|
|
External Examiner
– Weng Kin Ho, Dr. Martín Escardó
- 2006
|
|
57
|
Game Theoretic Analysis Of Call-By-Value Computation
– Kohei Honda, NOBUKO YOSHIDA
- 1997
|
|
24
|
A Tutorial on Co-induction and Functional Programming
– Andrew D. Gordon
- 1994
|
|
23
|
Games and full abstraction for nondeterministic languages
– Russell S. Harmer
- 1999
|
|
|
Higher Order Operationational Techniques in Semantics - Introduction
– A. D. Gordon, A. M. Pitts (Eds)
|
|
21
|
Correspondence between Operational and Denotational Semantics
– C. -h. L. Ong
- 1995
|
|
4
|
Games And Definability For FPC
– Guy Mccusker
- 1997
|
|
2
|
An operational domain-theoretic treatment of recursive types
– Weng Kin Ho
- 2006
|
|
4
|
Axioms for Definability and Full Completeness
– Samson Abramsky
- 2000
|
|
|
Computational Soundness and Adequacy for Typed Object Calculus
– Johan Glimming
|
|
29
|
Compilation by Transformation in Non-Strict Functional Languages
– André L. de M. Santos
- 1995
|
|
73
|
Operationally-based theories of program equivalence
– Andrew Pitts
- 1997
|
|
4
|
A Simple Adequate Categorical Model for PCF
– Torben Braüner
- 1997
|
|
4
|
Recursive Types in Games: Axiomatics and Process Representation (Extended Abstract)
– Marcelo Fiore, Kohei Honda
- 1998
|
|
|
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles
– Seyed H. Haeri (Hossein)
- 2009
|
