AbstractA semantic interpretation A for a programming language L is fully abstract if, whenever A〚C[M]〛⊑A〚C[N]〛 for two program phrases M,N and for all program contexts C[ ], it follows that A〚M〛⊑A〚N〛. A model M for the language is fully abstract if the natural interpretation A of L in M is fully abstract.We show that under certain conditions there exists, for an extended typed λ-calculus, a unique fully abstract model
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longest-standing problems in the ...
Abstract interpretation is very useful for program analysis, because it provides a (sound) over-appr...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...
AbstractA model-theoretic operation is characterized that preserves the property of being a model of...
We introduce the concept of logical full abstraction, generalising the usual equational notion. We ...
What does it mean that an encoding is fully abstract? What does it not mean? In this position paper,...
AbstractImplementations of abstract data types are defined via enrichments of a target type. We prop...
Most modern programming languages allow the user to define abstract data types, thereby creating an ...
AbstractAn abstract language for a computer of von Neumann type is presented. This language is consi...
AbstractThe term-generated models of an abstract data type can be represented by congruence relation...
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing th...
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing th...
AbstractThe λ-calculus is considered a useful mathematical tool in the study of programming language...
AbstractIn 1997, Cousot introduced a hierarchy where semantics are related with each other by abstra...
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longest-standing problems in the ...
Abstract interpretation is very useful for program analysis, because it provides a (sound) over-appr...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...
AbstractA model-theoretic operation is characterized that preserves the property of being a model of...
We introduce the concept of logical full abstraction, generalising the usual equational notion. We ...
What does it mean that an encoding is fully abstract? What does it not mean? In this position paper,...
AbstractImplementations of abstract data types are defined via enrichments of a target type. We prop...
Most modern programming languages allow the user to define abstract data types, thereby creating an ...
AbstractAn abstract language for a computer of von Neumann type is presented. This language is consi...
AbstractThe term-generated models of an abstract data type can be represented by congruence relation...
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing th...
AbstractA theory of abstract interpretation (P. Cousot and R. Cousot, in “Conf. Record, 4th ACM Symp...
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing th...
AbstractThe λ-calculus is considered a useful mathematical tool in the study of programming language...
AbstractIn 1997, Cousot introduced a hierarchy where semantics are related with each other by abstra...
The Full Abstraction Problem for PCF [23, 20, 7, 11] is one of the longest-standing problems in the ...
Abstract interpretation is very useful for program analysis, because it provides a (sound) over-appr...
AbstractRealizability interpretations of logics are given by saying what it means for computational ...
DOI
Add to ORKG