The system F of variable types, fifteen years later
Theoretical Computer Science
Full abstraction and semantic equivalence
Full abstraction and semantic equivalence
Theoretical Computer Science
Proofs and types
Stability and computability in coherent domains
Information and Computation
Can LCF be topped ? Flat lattice models of typed &lgr;-calculus
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Interdefinability of parallel operations in PCF
Theoretical Computer Science - Special issue: Part B: Logic, semantics, and theory of programming
Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
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
Sequentiality in an extensional framework
Papers presented at the IEEE symposium on Logic in computer science
Journal of the ACM (JACM)
Kripke logical relations and PCF
Information and Computation
Hypercoherences: a strongly stable model of linear logic
Proceedings of the workshop on Advances in linear logic
Information and Computation
Correspondence between operational and denotational semantics: the full abstraction problem for PCF
Handbook of logic in computer science (vol. 4)
Full Abstraction and the Context Lemma
SIAM Journal on Computing
Degrees of parallelism in the continuous type hierarchy
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Domains and lambda-calculi
When is a functional program not a functional program?
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Another Approach to Sequentiality: Kleene's Unimonotone Functions
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
(Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
Sequentially and parallelly computable functionals
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
SPCF: Its Model, Calculus, and Computational Power (Preliminary Version)
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Full abstraction for functional languages with control
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
On the computational complexity of Longeley's H functional
Theoretical Computer Science - Implicit computational complexity
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A Relational Model of a Parallel and Non-deterministic λ -Calculus
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
A Process-Model for Linear Programs
Types for Proofs and Programs
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
It is well-known that stable models (as dI-domains, qualitative domains and coherence spaces) are not fully abstract for the language PCF. This fact is related to the existence of stable parallel functions and of stable functions that are not monotone with respect to the extensional order, which cannot be defined by programs of PCF. In this paper, a paradigmatic programming language named StPCF is proposed, which extends the language PCF with two additional operators. The operational description of the extended language is presented in an effective way, although the evaluation of one of the new operators cannot be formalized in a PCF-like rewrite system. Since StPCF can define all finite cliques of coherence spaces the above gap with stable models is filled, consequently stable models are fully abstract for the extended language.