Detecting global variables in denotational specifications
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Introduction to higher order categorical logic
Introduction to higher order categorical logic
Type algebras, functor categories and block structure
Algebraic methods in semantics
Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Elementary data structures in Algol-like languages
Science of Computer Programming
Semantical analysis of specification logic
Information and Computation
Category theory for computing science
Category theory for computing science
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
A relational approach to strictness analysis for higher-order polymorphic functions
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Recursion over realizability structures
Information and Computation
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
Relational parametricity and local variables
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On functors expressible in the polymorphic typed lambda calculus
Information and Computation
Semantical analysis of specification logic, 2
Information and Computation
A variable typed logic of effects
Information and Computation
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Representation independence and data abstraction
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Craft of Programming
Types, Abstractions, and Parametric Polymorphism, Part 2
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
CSL '92 Selected Papers from the Workshop on Computer Science Logic
A Hoare Calculus for Functions Defined by Recursion on Higher Types
Proceedings of the Conference on Logic of Programs
Object-Oriented Programming Versus Abstract Data Types
Proceedings of the REX School/Workshop on Foundations of Object-Oriented Languages
Two Results on Set-Theoretic Polymorphism
Proceedings of the 4th International Conference on Category Theory and Computer Science
A category-theoretic approach to the semantics of programming languages
A category-theoretic approach to the semantics of programming languages
Imperative functional programming
ACM Computing Surveys (CSUR)
Semantics: the description of computational structures
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Denotational semantics using an operationally-based term model
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Design and static semantics of algorithm languageL
ACM SIGPLAN Notices
A simple proof technique for certain parametricity results
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Representation independence, confinement and access control [extended abstract]
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Objects and classes in Algol-like languages
Information and Computation - FOOL V
Soundness of data refinement for a higher-order imperative language
Theoretical Computer Science
Higher-Order and Symbolic Computation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Local Reasoning about Programs that Alter Data Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Information and Computation
A relational account of call-by-value sequentiality
Information and Computation - Special issue: LICS'97
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A categorical model for higher order imperative programming
Mathematical Structures in Computer Science
Correctness of data representations involving heap data structures
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Ownership confinement ensures representation independence for object-oriented programs
Journal of the ACM (JACM)
A comparative study of state emulation in functional programming languages: student paper
Journal of Computing Sciences in Colleges
A fibrational framework for possible-world semantics of Algol-like languages
Theoretical Computer Science
Relational semantics for effect-based program transformations with dynamic allocation
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Closing the stage: from staged code to typed closures
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Imperative self-adjusting computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Free-algebra models for the π -calculus
Theoretical Computer Science
Cryptographic logical relations
Theoretical Computer Science
Global State Considered Helpful
Electronic Notes in Theoretical Computer Science (ENTCS)
Monoidal Indeterminates and Categories of Possible Worlds
Electronic Notes in Theoretical Computer Science (ENTCS)
Correctness of data representations involving heap data structures
ESOP'03 Proceedings of the 12th European conference on Programming
On completeness of logical relations for monadic types
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
A Nominal Relational Model for Local Store
Electronic Notes in Theoretical Computer Science (ENTCS)
Assertion-based encapsulation, object invariants and simulations
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Lenses, fibrations and universal translations
Mathematical Structures in Computer Science
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Relational reasoning in a nominal semantics for storage
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Monoidal indeterminates and categories of possible worlds
Theoretical Computer Science
An automata-theoretic model of idealized algol
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Parameterized verification of open procedural programs
Proceedings of the Fifth Balkan Conference in Informatics
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata-Theoretic Semantics of Idealized Algol with Passive Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.01 |
We propose that the phenomenon of local state may be understood in terms of Strachey's concept of parametric (i.e., uniform) polymorphism. The intuitive basis for our proposal is the following analogy: a non-local procedure is independent of locally-declared variables in the same way that a parametrically polymorphic function is independent of types to which it is instantiated.A connection between parametricity and representational abstraction was first suggested by J.C. Reynolds. Reynolds used logical relations to formalize this connection in languages with type variables and user-defined types. We use relational parametricity to construct a model for an Algol-like language in which interactions between local and non-local entities satisfy certain relational criteria. Reasoning about local variables essentially involved proving properties of polymorphic functions. The new model supports straightforward validations of all the test equivalences that have been proposed in the literature for local-variable semantics, and encompasses standard methods of reasoning about data representations. It is not known whether our techniques yield fully abstract semantics. A model based on partial equivalence relations on the natural numbers is also briefly examined.