Full abstraction and semantic equivalence
Full abstraction and semantic equivalence
Theory and practice of sequential algorithms: the kernel of the applicative language CDS
Algebraic methods in semantics
Common LISP: the language
A syntactic theory of sequential control
Theoretical Computer Science
Fully abstract models of programming languages
Fully abstract models of programming languages
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning with continuations II: full abstraction for models of control
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Categorical Combinators, Sequential Algorithms and Funtional Programming
Categorical Combinators, Sequential Algorithms and Funtional Programming
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
An operational semantics for I/O in a lazy functional language
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Complete proof systems for algebraic simply-typed terms
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Isolating side effects in sequential languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
What is a purely functional language?
Journal of Functional Programming
Information and Computation
Theoretical Computer Science - Applied semantics: Selected topics
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)
Decidability and syntactic control of interference
Theoretical Computer Science
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Typed closure conversion preserves observational equivalence
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Some Programming Languages Suggested by Game Models (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
A fully abstract bidomain model of unary FPC
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Nondeterminism and observable sequentiality
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
An equivalence-preserving CPS translation via multi-language semantics
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Bidomains and full abstraction for countable nondeterminism
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Decidability in syntactic control of interference
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The elimination of nesting in SPCF
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Local variable scoping and kleene algebra with tests
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Relational semantics for higher-order programs
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
| Hi-index | 0.00 |
One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fifteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting the evaluation order of arguments in procedures. Since we believe that such facilities are crucial for understanding the nature of sequential computation, this paper focuses on a sequential extension of PCF (called SPCF) that includes two classes of control operators: error generators enable us to construct a fully abstract model for SPCF that interprets higher types as sets of error-sensitive functions instead of continuous functions. The error-sensitve functions form a Scott domain that is isomorphic to a domain of decision trees. We believe that the same construction will yield fully abstract models for functional languages with different control operators for observing the order of evaluation.