Communication and concurrency
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Equality in lazy computation systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Algebraic reconstruction of types and effects
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Full abstraction in the lazy lambda calculus
Information and Computation
Implementation of the typed call-by-value λ-calculus using a stack of regions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional programming and input/output
Functional programming and input/output
Better static memory management: improving region-based analysis of higher-order languages
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Proving congruence of bisimulation in functional programming languages
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
From region inference to von Neumann machines via region representation inference
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimilarity for a first-order calculus of objects with subtyping
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Region-based memory management
Information and Computation
Behavioral equivalence in the polymorphic pi-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Memory management with explicit regions
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Typed memory management in a calculus of capabilities
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher order operational techniques in semantics
Higher order operational techniques in semantics
Operational equivalences for untyped and polymorphic object calculi
Higher order operational techniques in semantics
Relational reasoning about contexts
Higher order operational techniques in semantics
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Reasoning about functions with effects
Higher order operational techniques in semantics
Bisimilarity as a theory of functional programming
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Integrating functional and imperative programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Unification and polymorphism in region inference
Proof, language, and interaction
Stratified operational semantics for safety and correctness of the region calculus
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed memory management via static capabilities
ACM Transactions on Programming Languages and Systems (TOPLAS)
A constraint-based region inference algorithm
Theoretical Computer Science
Enforcing high-level protocols in low-level software
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
On regions and linear types (extended abstract)
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Region-based memory management in cyclone
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
The Definition of Standard ML
Syntactic type soundness results for the region calculus
Information and Computation
Certifying Compilation and Run-Time Code Generation
Higher-Order and Symbolic Computation
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
A Sound Metalogical Semantics for Input/Output Effects
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Programming, Transforming, and Providing with Function Abstractions and Memories
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A direct approach to control-flow sensitive region-based memory management
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Region Analysis and the Polymorphic Lambda Calculus
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Region analysis and a π-calculus with groups
Journal of Functional Programming
A Retrospective on Region-Based Memory Management
Higher-Order and Symbolic Computation
Polymorphic specialization for ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Polymorphic specialization for ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reading, writing and relations: towards extensional semantics for effect analyses
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Hi-index | 0.00 |
A region calculus is a programming language calculus with explicit instrumentation for memory management. Every value is annotated with a region in which it is stored and regions are allocated and deallocated in a stack-like fashion. The annotations can be statically inferred by a type and effect system, making a region calculus suitable as an intermediate language for a compiler of statically typed programming languages.Although a lot of attention has been paid to type soundness properties of different flavors of region calculi, it seems that little effort has been made to develop a semantic framework. In this paper, we present a theory based on bisimulation, which serves as a coinductive proof principle for showing equivalences of polymorphically region-annotated terms. Our notion of bisimilarity is reminiscent of open bisimilarity for the 驴-calculus and we prove it sound and complete with respect to Morris-style contextual equivalence.As an application, we formulate a syntactic equational theory, which is used elsewhere to prove the soundness of a specializer based on region inference. We use our bisimulation framework to show that the equational theory is sound with respect to contextual equivalence.