No abstract available.
Cited By
- Støvring K and Lassen S A complete, co-inductive syntactic theory of sequential control and state Semantics and algebraic specification, (329-375)
- Pitts A and Shinwell M (2007). Generative unbinding of names, ACM SIGPLAN Notices, 42:1, (85-95), Online publication date: 17-Jan-2007.
- Støvring K and Lassen S (2007). A complete, co-inductive syntactic theory of sequential control and state, ACM SIGPLAN Notices, 42:1, (161-172), Online publication date: 17-Jan-2007.
- Pitts A and Shinwell M Generative unbinding of names Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (85-95)
- Støvring K and Lassen S A complete, co-inductive syntactic theory of sequential control and state Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (161-172)
- Banerjee A and Naumann D (2005). Ownership confinement ensures representation independence for object-oriented programs, Journal of the ACM (JACM), 52:6, (894-960), Online publication date: 1-Nov-2005.
- Vouillon J and Melliès P (2004). Semantic types, ACM SIGPLAN Notices, 39:1, (52-63), Online publication date: 1-Jan-2004.
- Vouillon J and Melliès P Semantic types Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (52-63)
- Moran A, Sands D and Carlsson M (2019). Erratic fudgets, Science of Computer Programming, 46:1-2, (99-135), Online publication date: 1-Jan-2003.
- Banerjee A and Naumann D Representation independence, confinement and access control [extended abstract] Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (166-177)
- Fournet C and Gordon A Stack inspection Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (307-318)
- Banerjee A and Naumann D (2002). Representation independence, confinement and access control [extended abstract], ACM SIGPLAN Notices, 37:1, (166-177), Online publication date: 1-Jan-2002.
- Fournet C and Gordon A (2002). Stack inspection, ACM SIGPLAN Notices, 37:1, (307-318), Online publication date: 1-Jan-2002.
- Gustavsson J and Sands D Possibilities and limitations of call-by-need space improvement Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, (265-276)
- Gustavsson J and Sands D (2001). Possibilities and limitations of call-by-need space improvement, ACM SIGPLAN Notices, 36:10, (265-276), Online publication date: 1-Oct-2001.
- Taha W A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trival Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (34-43)
- Moran A and Sands D Improvement in a lazy context Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (43-56)
- Taha W (1999). A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trival, ACM SIGPLAN Notices, 34:11, (34-43), Online publication date: 1-Nov-1999.
- Gordon A, Hankin P and Lassen S (2019). Compilation and equivalence of imperative objects, Journal of Functional Programming, 9:4, (373-426), Online publication date: 1-Jul-1999.
- (2019). Parametric Polymorphism and Operational Equivalence (Preliminary Version), Electronic Notes in Theoretical Computer Science (ENTCS), 10:C, (2-27), Online publication date: 1-May-1998.
Index Terms
- Higher order operational techniques in semantics
Recommendations
Abstract operational semantics for use case maps
FORTE'05: Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed SystemsScenario-driven requirement specifications are widely used to capture and represent functional requirements. Use Case Maps (UCM) is being standardized as part of the User Requirements Notation (URN), the most recent addition to ITU–T’s family of ...
An operational semantics for ZCCS
ICFEM '97: Proceedings of the 1st International Conference on Formal Engineering MethodsG. Bruns (1995) has proposed a version of value-passing CCS in which an agent language, based on that proposed by Milner, is augmented with a rich data language. The data language can be used to describe sets, tuples and sequences etc. constructed from ...
A refined operational semantics for ACT-R: investigating the relations between different ACT-R formalizations
PPDP '15: Proceedings of the 17th International Symposium on Principles and Practice of Declarative ProgrammingThe popular cognitive architecture ACT-R is used in many cognitive models to explain cognitive features of human-beings. It has a well-defined psychological theory but lacks a formalization of its underlying computational system. This lack allows for ...