Andrew D. Gordon. Bisimilarity as a theory of functional programming. mini-course. Number NS-95-3 in the BRICS Notes Series, Computer Science Department, Aarhus, 1995. 51 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Encoding FIX in Object Calculi - Crole (2002) (Correct)
....semantics. We shall assume that readers are familiar with type theory, and more speci cally with type theories possessing judgements of both equality, and operational reduction. A good general reference for (dependent) type theory is the book [10] For operational reduction, see for example [2, 4, 6, 8, 11, 12, 13]. In fact the results presented here are founded on the FIX type theory introduced by Crole and Pitts in [3] and the object type theories (calculi) introduced by Abadi and Cardelli in [1] If the reader is not familiar with the details of these type theories, we would ask that they consult the ....
A. D. Gordon. Bisimilarity as a theory of functional programming. Electronic Notes in Theoretical Computer Science, 1, 1995.
Full Abstraction for HOPLA - Nygaard, Winskel (2003) (Correct)
....P # P # : a # t t # : P # . Note that the reduction is done uniformly at all types using deconstructor contexts: application, projection, and unfolding. This explains the somewhat mysterious function space actions u a. A similar use of labels to carry context information appears e.g. in [6]. Soundness says that the operational notion of successor is included in the semantic notion. The proof is by rule induction on the transition rules, see [20] Proposition 10 (Soundness) If P : t t # : P # , then # #t#. We obtain a corresponding adequacy result using logical ....
A. D. Gordon. Bisimilarity as a theory of functional programming. In Proc. MFPS'95, ENTCS 1.
An Equational Theory for a Region Calculus - Revised - Helsen (2002) (Correct)
....type based: region annotation is guided by a type and e ect analysis. Using bisimulation, a proof method originating from work on CCS [35] we prove that the equational theory is sound with respect to Morris style contextual equivalence [38, 44] Following methods by Gordon, Abramsky and others [2, 11, 15 17, 19], we specify a notion of applicative bisimilarity for the region calculus. With a proof technique due to Howe [24,25] recasted to typed functional programming languages by Gordon [15] we show that bisimilarity is a congruence for our region calculus. We use this result to prove that bisimilarity ....
....operational method to reason about equivalences in functional programming languages, dates from the early 90s, when Abramsky [1] and Abramsky and Ong [2] de ne a notion of applicative bisimilarity for the lazy lambda calculus. Since then, bisimilarity has been extended and netuned by Gordon [15 17] and Crole and Gordon [11] to other programming models. Notably, Gordon [17] proved that a form of bisimilarity for PCF with lazy streams is fully abstract with respect to contextual equivalence. We closely follow Gordon s results on contextual equivalence for a polymorphically typed object ....
[Article contains additional citation context not shown here]
Andrew Gordon. Bisimilarity as a theory of functional programming. Theoretical Computer Science, 228(1-2):5-47, October 1999.
A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1998) (353 citations) Self-citation (Gordon) (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. Mini-course. BRICS Notes Series NS--95--3, BRICS, Aarhus University, 1995. Full version of MFPS'95 paper.
A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1996) (353 citations) Self-citation (Gordon) (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. Mini-course. BRICS Notes Series NS--95--3, BRICS, Aarhus University, 1995. Full version of MFPS'95 paper.
Stack Inspection: Theory and Variants - Fournet, Gordon (2001) (1 citation) Self-citation (Gordon) (Correct)
....precongruence (Cand) # . e # e # # # e ## Lemma 12 The following rules are derivable. Cand Refl) e # . e (Cand Comp) e # . e # (Cand Sim) e # # e # (Cand Right) e # . e # e # # # e ## (Cand Subst) e # . e # v # . v # x#v Proof By standard arguments; see Gordon [12], for instance. # Two auxiliary definitions are useful. We define # . c to be the candidate relation restricted to closed expressions. Moreover, if is a relation on closed expressions, we let be the relation on closed expressions defined below. Let e # . c e # if and only if e # . e # ....
A. D. Gordon. Bisimilarity as a theory of functional programming. Theoretical Computer Science, 228:5--47, 1999. 71
From Rewrite Rules to Bisimulation - Congruences Peter Sewell (Correct)
No context found.
Andrew D. Gordon. Bisimilarity as a theory of functional programming. mini-course. Number NS-95-3 in the BRICS Notes Series, Computer Science Department, Aarhus, 1995. 51
Unknown - (Correct)
No context found.
Andrew D. Gordon. Bisimilarity as a theory of functional programming. mini-course. Number NS-95-3 in the BRICS Notes Series, Computer Science Department, Aarhus, 1995. 72 REFERENCES
Unknown - (Correct)
No context found.
Andrew D. Gordon. Bisimilarity as a theory of functional programming. mini-course. Number NS-95-3 in the BRICS Notes Series, Computer Science Department, Aarhus, 1995.
Basic Research in Computer Science - New-Hopla Higher-Order Process (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming: mini-course. Notes Series BRICS-NS-95-3, BRICS, Department of Computer Science, University of Aarhus, July 1995.
Proof Methods for Corecursive Programs - Gibbons, Hutton (2005) (1 citation) (Correct)
No context found.
Gordon, A.: Bisimilarity as a Theory of Functional Programming, BRICS Notes Series NS-95-3, Aarhus University, 1995.
Towards a Primitive Higher Order Calculus - Of Broadcasting Systems (Correct)
No context found.
Andrew D. Gordon. Bisimilarity as a theory of functional programming: minicourse. Notes Series BRICS-NS-95-3, BRICS, Department of Computer Science, University of Aarhus, July 1995.
Towards a Primitive Higher Order Calculus - Of Broadcasting Systems (Correct)
No context found.
Andrew D. Gordon. Bisimilarity as a theory of functional programming: minicourse. Notes Series BRICS-NS-95-3, BRICS, Department of Computer Science, University of Aarhus, July 1995.
From Sequential Programs to Multi-Tier Applications by.. - Neubauer, Thiemann (2005) (Correct)
No context found.
A. Gordon. Bisimilarity as a theory of functional programming. Theoretical Computer Science, 228(1-2):5--47, Oct. 1999.
Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (2001) (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. Electronic Notes in Theoretical Computer Science, 1, 1995.
Names, Equations, Relations: Practical Ways to Reason about new .. - Stark (1997) (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. In Mathematical Foundations of Programming Semantics: Proceedings of the 11th International Conference, Electronic Notes in Theoretical Computer Science 1. Elsevier, 1995.
Domain Theory for Concurrency - Nygaard (2003) (1 citation) (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. In Proc. MFPS'95, ENTCS 1.
Technical Report - Number Ucam-Cl-Tr- Issn (1985) (2 citations) (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming: mini-course. Notes Series BRICS-NS-95-3, BRICS, Department of Computer Science, University of Aarhus, July 1995.
M. Dowse, A. Butterfield, M. van Eekelen , M. de Mol , R.. - Nijmegen Institute For (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming: mini-course. Notes Series BRICS-NS-95-3, BRICS, Department of Computer Science, University of Aarhus, July 1995.
Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. Electronic Notes in Theoretical Computer Science, 1, 1995.
Domain Theory for Concurrency - Nygaard (2003) (1 citation) (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. In Proc. MFPS'95, ENTCS 1.
A theory of bisimulation for a fragment of concurrent ML - With Local Names (Correct)
No context found.
A. Gordon. Bisimilarity as a theory of functional programming. In Proc. MFPS 95, number 1 in Electronic Notes in Comp. Sci. Springer-Verlag, 1995.
A symbolic labelled transition system for coinductive subtyping.. - Jeffrey (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. In Proc. Math. Foundations of Programming Semantics, number 1 in Electronic Notes in Comp. Sci. Elsevier, 1995.
Mechanized Operational Semantics via (Co)Induction - Simon Ambler And (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. Technical report, Aarhus University, Denmark, 1995. BRICS Notes Series NS{95-3, BRICS, Aarhus University.
Mechanized Operational Semantics via (Co)Induction - Simon Ambler And (Correct)
No context found.
A. D. Gordon. Bisimilarity as a theory of functional programming. Electronic Notes in Theoretical Computer Science, 1, 1995.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC