Research topics in functional programming
Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Full abstraction in the lazy lambda calculus
Information and Computation
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Fully abstract semantics for observably sequential languages
Information and Computation
Kripke logical relations and PCF
Information and Computation
Theoretical Computer Science
Decidability of behavioural equivalence in unary PCF
Theoretical Computer Science
Proving termination with multiset orderings
Communications of the ACM
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Games and Full Abstraction for the Lazy Lambda-Calculus
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Relational Account of Call-by-Value Sequentially
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Game semantics for the pure lazy λ-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
| Hi-index | 0.00 |
We present a fully abstract and effectively presentable model of unary FPC (a version of FPC with lifting rather than lifted sums) in a category of bicpos and continuous and stable functions. We show universality for the corresponding model of unary PCF, and then show that this implies full abstraction for unary FPC. We use a translation into this metalanguage to show that the "canonical" bidomain model of the lazy λ-calculus (with seqential convergence testing) is fully abstract.