A Stratified Semantics of General References Embeddable in Higher-Order Logic (Extended Abstract)

A Stratified Semantics of General References Embeddable in Higher-Order Logic (Extended Abstract) (2002)

Cached

Download Links

by Amal J. Ahmed , Andrew W. Appel , Roberto Virga

Citations:

BibTeX

@MISC{Ahmed02astratified,
    author = {Amal J. Ahmed and Andrew W. Appel and Roberto Virga},
    title = {A Stratified Semantics of General References Embeddable in Higher-Order Logic (Extended Abstract)},
    year = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Amal J. Ahmed Andrew W. Appel # Roberto Virga Princeton University {amal,appel,rvirga}@cs.princeton.edu Abstract We demonstrate a semantic model of general references --- that is, mutable memory cells that may contain values of any (statically-checked) closed type, including other references. Our model is in terms of execution sequences on a von Neumann machine

Citations

1016	Proof-carrying code - Necula - 1997
634	A framework for defining logics - Harper, Honsell, et al. - 1999
557	From system F to typed assembly language - Morrisett, Walker, et al. - 1999
281	System description: Twelf - a meta-logical framework for deductive systems - Pfenning, Schürmann - 1999
216	Report on the programming language Haskell, a non-strict, purely functional language - Hudak, Jones, et al. - 1992
187	Logic in Computer Science. Modelling and reasoning about systems - Huth, Ryan - 2000
172	The logic of bunched implications - O’Hearn, Pym - 1999
155	The essence of Algol - Reynolds - 1981
155	1963: ‘Semantical considerations on modal logic - Kripke
148	as an assertion language for mutable data structures - BI - 2001
122	A semantic model of types and machine instructions for proof-carrying code - Appel, Felty - 2000
114	An indexed model of recursive types for foundational proof-carrying code - Appel, McAllester - 2001
106	Observable properties of higher order functions that dynamically create local names, or what’s new - Pitts, Stark - 1993
105	G.: A fully abstract game semantics for general references - Abramsky, Honda, et al. - 1998
104	Type inference for polymorphic references - Tofte - 1990
101	Intuitionistic reasoning about shared mutable data structure - Reynolds - 2000
74	Co-induction in relational semantics - Milner, Tofte - 1991
70	Impossible possible worlds vindicated - Hintikka - 1975
65	Some techniques for proving correctness of programs which alter data structures - Burstall - 1972
57	Vicious circles. On the mathematics of non-wellfounded phenomena - Barwise, Moss - 1996
56	A simplified account of polymorphic references - Harper - 1994
50	Names and Higher-Order Functions - Stark - 1994
44	A Category-Theoretic Approach to the Semantics of Programming Languages - Oles - 1982
40	Fixpoint induction and proofs of program properties - Park - 1969
28	Machine instruction syntax and semantics in higher order logic - Michael, Appel - 2000
27	I.: Domains and denotational semantics: History, accomplishments and open problems - Fiore, Jung, et al. - 1996
25	Non-Well-Founded Sets”; Center for the Study of Language and - Aczel - 1998
6	Functor categories and store shapes - Oles - 1997
2	Possible worlds: A critical analysis. The Prague Bulletin of Mathematical Linguistics - Peregrin - 1993
2	Foundational semantics for tal syntactic rules via typed machine language. Submitted for publication - Swadi, Appel - 2002