Skip header Section
Skip Bibliometrics Section
Denotational Semantics: The Scott-Strachey Approach to Programming Language TheoryJanuary 1977
- Author:
- Joseph E. Stoy
Skip Abstract Section
Abstract
From the Publisher: "First book-length exposition of the denotational (or `mathematical' or `functional') approach to the formal semantics of programming languages (in contrast to `operational' and `axiomatic' approaches). Treats various kinds of languages, beginning with the pure-lambda-calculus and progressing through languages with states, commands, jumps, and assignments. This somewhat discursive account is a valuable compilation of results not otherwise available in a single source." -- American Mathematical Monthly
Cited By
- Charalambidis A and Rondogiannis P Categorical Approximation Fixpoint Theory Logics in Artificial Intelligence, (515-530)
- Berghammer R Relational Computation of Sets of Relations Relational and Algebraic Methods in Computer Science, (54-71)
Harrison W, Hathhorn C and Allwein G A Mechanized Semantic Metalanguage for High Level Synthesis Proceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming, (1-14)- Charalambidis A, Chatziagapis G and Rondogiannis P A Fixed Point Theorem on Lexicographic Lattice Structures Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, (301-311)
- Bono V and Dezani-Ciancaglini M A tale of intersection types Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, (7-20)
- Blikle A (2019). An Experiment with Denotational Semantics, SN Computer Science, 1:1, Online publication date: 1-Jan-2020.
- Guttmann W Connecting Fixpoints of Computations with Strict Progress Unifying Theories of Programming, (62-79)
- Liu Z, Bowen J, Liu B, Tyszberowicz S and Zhang T Software Abstractions and Human-Cyber-Physical Systems Architecture Modelling Engineering Trustworthy Software Systems, (159-219)
- Blöcker C and Hoffmann U (2018). Pardis, The Journal of Supercomputing, 74:4, (1473-1484), Online publication date: 1-Apr-2018.
- Chihani Z, Miller D and Renaud F (2017). A Semantic Framework for Proof Evidence, Journal of Automated Reasoning, 59:3, (287-330), Online publication date: 1-Oct-2017.
- Shan C and Ramsey N (2017). Exact Bayesian inference by symbolic disintegration, ACM SIGPLAN Notices, 52:1, (130-144), Online publication date: 11-May-2017.
- Shan C and Ramsey N Exact Bayesian inference by symbolic disintegration Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (130-144)
- Castro D, Hammond K and Sarkar S (2016). Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms, ACM SIGPLAN Notices, 51:9, (4-17), Online publication date: 5-Dec-2016.
- Castro D, Hammond K and Sarkar S Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, (4-17)
- Rodrigues V, Akesson B, Florido M, de Sousa S, Pedroso J and Vasconcelos P (2015). Certifying execution time in multicores, Science of Computer Programming, 111:P3, (505-534), Online publication date: 1-Nov-2015.
- Broy M (2015). Computability and realizability for interactive computations, Information and Computation, 241:C, (277-301), Online publication date: 1-Apr-2015.
- Meijer E, Millikin K and Bracha G (2015). Spicing Up Dart with Side Effects, Queue, 13:3, (40-59), Online publication date: 1-Mar-2015.
- Jones C, Lovert M and Steggles L (2014). Revising basic theorem proving algorithms to cope with the logic of partial functions, Science of Computer Programming, 94:P2, (238-252), Online publication date: 1-Nov-2014.
- Omar C, Kurilova D, Nistor L, Chung B, Potanin A and Aldrich J Safely Composable Type-Specific Languages Proceedings of the 28th European Conference on ECOOP 2014 --- Object-Oriented Programming - Volume 8586, (105-130)
- Irigoin F, Jouvelot P and Triolet R Semantical interprocedural parallelization ACM International Conference on Supercomputing 25th Anniversary Volume, (143-150)
- Midtgaard J, Ramsey N and Larsen B Engineering definitional interpreters Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, (121-132)
- Howells P and d'Inverno M (2013). Specifying termination in CSP, Theoretical Computer Science, 503:C, (31-60), Online publication date: 9-Sep-2013.
- Dong R, Faber J, Ke W and Liu Z rCOS Unifying Theories of Programming and Formal Engineering Methods, (1-66)
- Charalambidis A, Handjopoulos K, Rondogiannis P and Wadge W (2013). Extensional Higher-Order Logic Programming, ACM Transactions on Computational Logic, 14:3, (1-40), Online publication date: 1-Aug-2013.
- Rodrigues V, Akesson B, Melo De Sousa S and Florido M A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction Proceedings of the 15th International Symposium on Practical Aspects of Declarative Languages - Volume 7752, (43-59)
- Micciancio D and Tessaro S An equational approach to secure multi-party computation Proceedings of the 4th conference on Innovations in Theoretical Computer Science, (355-372)
- Bailes P and Brough L Making sense of recursion patterns Proceedings of the First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches, (16-22)
- Ostermann K, Giarrusso P, Kästner C and Rendel T Revisiting information hiding Proceedings of the 25th European conference on Object-oriented programming, (155-178)
- Rabinovich E, Etzion O and Gal A Pattern rewriting framework for event processing optimization Proceedings of the 5th ACM international conference on Distributed event-based system, (101-112)
- Butterfield A Reasoning about i/o in functional programs Proceedings of the 4th Summer School conference on Central European Functional Programming School, (93-141)
- Stuurman G and Kurtev I Action semantics for defining dynamic semantics of modeling languages Proceedings of the Third Workshop on Behavioural Modelling, (64-71)
- Demirezen Z, Bryant B, Skjellum A and Tanik M (2010). DESIGN SPACE ANALYSIS IN MODEL-DRIVEN ENGINEERING, Journal of Integrated Design & Process Science, 14:1, (1-15), Online publication date: 1-Jan-2010.
- Harrison W and Hook J (2009). Achieving information flow security through monadic control of effects, Journal of Computer Security, 17:5, (599-653), Online publication date: 1-Oct-2009.
- Howells P and d’Inverno M (2008). A CSP model with flexible parallel termination semantics, Formal Aspects of Computing, 21:5, (421-449), Online publication date: 1-Oct-2009.
- Crolard T, Polonowski E and Valarcher P (2009). Extending the loop language with higher-order procedural variables, ACM Transactions on Computational Logic, 10:4, (1-37), Online publication date: 1-Aug-2009.
- Miller D (2009). Formalizing Operational Semantic Specifications in Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 246, (147-165), Online publication date: 1-Aug-2009.
- Koopman P, Plasmeijer R and Achten P An effective methodology for defining consistent semantics of complex systems Proceedings of the Third summer school conference on Central European functional programming school, (224-267)
- Hines P (2008). Machine semantics, Theoretical Computer Science, 409:1, (1-23), Online publication date: 1-Dec-2008.
- Danvy O (2008). Defunctionalized interpreters for programming languages, ACM SIGPLAN Notices, 43:9, (131-142), Online publication date: 27-Sep-2008.
- Danvy O Defunctionalized interpreters for programming languages Proceedings of the 13th ACM SIGPLAN international conference on Functional programming, (131-142)
- Guttmann W Lazy UTP Proceedings of the 2nd international conference on Unifying theories of programming, (82-101)
- Gabbay M and Gabbay M (2008). a-Logic With Arrows, Electronic Notes in Theoretical Computer Science (ENTCS), 216, (3-29), Online publication date: 1-Jul-2008.
- Foo N and Renz J Experience and Trust ---A Systems-Theoretic Approach Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, (867-868)
- Danvy O From reduction-based to reduction-free normalization Proceedings of the 6th international conference on Advanced functional programming, (66-164)
- Benton N Undoing dynamic typing (declarative pearl) Proceedings of the 9th international conference on Functional and logic programming, (224-238)
- Ostermann K Reasoning about aspects with common sense Proceedings of the 7th international conference on Aspect-oriented software development, (48-59)
- Lester D Topology in PVS Proceedings of the second workshop on Automated formal methods, (11-20)
- Smith J, Dos Reis G and Järvi J Algorithmic differentiation in Axiom Proceedings of the 2007 international symposium on Symbolic and algebraic computation, (347-354)
- Hills M, Şerbănuţă T and Roşu G (2007). A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters, Electronic Notes in Theoretical Computer Science (ENTCS), 176:4, (215-231), Online publication date: 1-Jul-2007.
- Turner R (2007). Understanding Programming Languages, Minds and Machines, 17:2, (203-216), Online publication date: 1-Jul-2007.
- Eden A (2007). Three Paradigms of Computer Science, Minds and Machines, 17:2, (135-167), Online publication date: 1-Jul-2007.
- Black A, Hutchinson N, Jul E and Levy H The development of the Emerald programming language Proceedings of the third ACM SIGPLAN conference on History of programming languages, (11-1-11-51)
- Ward M and Zedan H (2007). Slicing as a program transformation, ACM Transactions on Programming Languages and Systems, 29:2, (7-es), Online publication date: 1-Apr-2007.
- Mosses P VDM semantics of programming languages Formal methods and hybrid real-time systems, (483-503)
- Jones C Understanding programming language concepts via operational semantics Domain modeling and the duration calculus, (177-235)
- Frost R (2006). Realization of natural language interfaces using lazy functional programming, ACM Computing Surveys, 38:4, (11-es), Online publication date: 25-Dec-2006.
- van Emden M Compositional semantics for the procedural interpretation of logic Proceedings of the 22nd international conference on Logic Programming, (315-329)
- Collinson M and Pym D (2006). Bunching for Regions and Locations, Electronic Notes in Theoretical Computer Science (ENTCS), 158, (171-197), Online publication date: 1-May-2006.
- Jones C (2006). An Approach to Splitting Atoms Safely, Electronic Notes in Theoretical Computer Science (ENTCS), 155, (43-60), Online publication date: 1-May-2006.
- McIver A and Morgan C (2006). A Novel Stochastic Game Via the Quantitative μ-calculus, Electronic Notes in Theoretical Computer Science (ENTCS), 153:2, (195-212), Online publication date: 1-May-2006.
- van Riemsdijk M, Meyer J and de Boer F (2006). Semantics of plan revision in intelligent agents, Theoretical Computer Science, 351:2, (240-257), Online publication date: 21-Feb-2006.
- Kamin S, Aktemur B and Morton P Source-level optimization of run-time program generators Proceedings of the 4th international conference on Generative Programming and Component Engineering, (293-308)
- Pettyjohn G, Clements J, Marshall J, Krishnamurthi S and Felleisen M Continuations from generalized stack inspection Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, (216-227)
- Pettyjohn G, Clements J, Marshall J, Krishnamurthi S and Felleisen M (2005). Continuations from generalized stack inspection, ACM SIGPLAN Notices, 40:9, (216-227), Online publication date: 12-Sep-2005.
- Padovani L Compilation of generic regular path expressions using c++ class templates Proceedings of the 14th international conference on Compiler Construction, (27-42)
- Danvy O A rational deconstruction of landin's SECD machine Proceedings of the 16th international conference on Implementation and Application of Functional Languages, (52-71)
- Arasu A and Widom J (2004). A denotational semantics for continuous queries over streams and relations, ACM SIGMOD Record, 33:3, (6-11), Online publication date: 1-Sep-2004.
- Zhang Y and Xu B (2004). A survey of semantic description frameworks for programming languages, ACM SIGPLAN Notices, 39:3, (14-30), Online publication date: 1-Mar-2004.
- Hughes D and Shmatikov V (2004). Information hiding, anonymity and privacy: a modular approach, Journal of Computer Security, 12:1, (3-36), Online publication date: 1-Jan-2004.
- Jones C (2003). Operational semantics, Information Processing Letters, 88:1-2, (27-32), Online publication date: 17-Oct-2003.
- Ager M, Biernacki D, Danvy O and Midtgaard J A functional correspondence between evaluators and abstract machines Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming, (8-19)
- Wah K (2003). An analysis of the coupling effect I, Science of Computer Programming, 48:2-3, (119-161), Online publication date: 1-Aug-2003.
- Jones C (2003). The Early Search for Tractable Ways of Reasoning about Programs, IEEE Annals of the History of Computing, 25:2, (26-49), Online publication date: 1-Apr-2003.
- Hoare C (2003). Assertions, IEEE Annals of the History of Computing, 25:2, (14-25), Online publication date: 1-Apr-2003.
- Doh K and Mosses P (2003). Composing programming languages by combining action-semantics modules, Science of Computer Programming, 47:1, (3-36), Online publication date: 1-Apr-2003.
- Jacobs B and Poll E (2003). Coalgebras and monads in the semantics of java, Theoretical Computer Science, 291:3, (329-349), Online publication date: 6-Jan-2003.
- Nielson F, Nielson H and Seidl H (2002). A succinct solver for ALFP, Nordic Journal of Computing, 9:4, (335-372), Online publication date: 1-Dec-2002.
- Nigiyan S and Avetisyan S (2002). Semantics of Untyped Functional Programs, Programming and Computing Software, 28:3, (119-126), Online publication date: 1-May-2002.
- Yi K and Ryu S (2002). A cost-effective estimation of uncaught exceptions in standard ML programs, Theoretical Computer Science, 277:1-2, (185-217), Online publication date: 28-Apr-2002.
- Case J, Jain S and Suraj M (2002). Control structures in hypothesis spaces, Theoretical Computer Science, 270:1-2, (287-308), Online publication date: 6-Jan-2002.
- Sestoft P Demonstrating lambda calculus reduction The essence of computation, (420-435)
- Gibbons J Calculating functional programs Algebraic and coalgebraic methods in the mathematics of program construction, (149-201)
- Byers D, Kamkar M and Palsson T Syntax-Directed Construction of Value Dependence Graphs Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
- Harrison B and Sheard T Dynamically adaptable software with metacomputations in a staged language Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation, (163-182)
- Zhu M (2001). Formal specifications of debuggers, ACM SIGPLAN Notices, 36:9, (54-63), Online publication date: 1-Sep-2001.
- Zhu M (2001). Denotational semantics of programming languages and compiler generation in PowerEpsilon, ACM SIGPLAN Notices, 36:9, (39-53), Online publication date: 1-Sep-2001.
- Vatan F Distribution functions of probabilistic automata Proceedings of the thirty-third annual ACM symposium on Theory of computing, (684-693)
- Edwards S, Lavagno L, Lee E and Sangiovanni-Vincentelli A Design of embedded systems Readings in hardware/software co-design, (86-107)
- Harald E. O (2001). From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice, Journal of Computer Science and Technology, 16:3, (208-230), Online publication date: 1-May-2001.
- Chroboczek J Game Semantics and Subtyping Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Mosses P (2000). A Foreword to ‘Fundamental Concepts in ProgrammingLanguages’, Higher-Order and Symbolic Computation, 13:1-2, (7-9), Online publication date: 1-Apr-2000.
- Tennent R and Ghica D (2000). Abstract Models of Storage, Higher-Order and Symbolic Computation, 13:1-2, (119-129), Online publication date: 1-Apr-2000.
- Scott D (2000). Some Reflections on Strachey and His Work, Higher-Order and Symbolic Computation, 13:1-2, (103-114), Online publication date: 1-Apr-2000.
- Sheard T, Benaissa Z and Pasalic E (1999). DSL implementation using staging and monads, ACM SIGPLAN Notices, 35:1, (81-94), Online publication date: 1-Jan-2000.
- Sheard T, Benaissa Z and Pasalic E DSL implementation using staging and monads Proceedings of the 2nd conference on Domain-specific languages, (81-94)
- Sheard T, Benaissa Z and Pasalic E DSL implementation using staging and monads Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2, (7-7)
- Foo N, Pagnucco M and Nayak A Diagrammatic proofs Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1, (378-383)
- Braüner T (1998). A Simple Adequate Categorical Model for PCF, II, Fundamenta Informaticae, 33:4, (339-368), Online publication date: 1-Dec-1998.
- Moreau L (1998). A Syntactic Theory of Dynamic Binding, Higher-Order and Symbolic Computation, 11:3, (233-279), Online publication date: 1-Oct-1998.
- Kučan J (1998). Retraction Approach to CPS Transform, Higher-Order and Symbolic Computation, 11:2, (145-175), Online publication date: 1-Sep-1998.
- Abelson H, Dybvig R, Haynes C, Rozas G, Adams Iv N, Friedman D, Kohlbecker E, Steele G, Bartley D, Halstead R, Oxley D, Sussman G, Brooks G, Hanson C, Pitman K and Wand M (1998). Revised Report on the Algorithmic Language Scheme, Higher-Order and Symbolic Computation, 11:1, (7-105), Online publication date: 1-Aug-1998.
- Janneck J (1998). Generalizing lookahead—behavioral prediction in distributed simulation, ACM SIGSIM Simulation Digest, 28:1, (12-19), Online publication date: 1-Jul-1998.
- Janneck J Generalizing lookahead—behavioral prediction in distributed simulation Proceedings of the twelfth workshop on Parallel and distributed simulation, (12-19)
- Binkley D (1997). Semantics Guided Regression Test Cost Reduction, IEEE Transactions on Software Engineering, 23:8, (498-516), Online publication date: 1-Aug-1997.
- Booth C and Bruce D (1997). Stack-free process-oriented simulation, ACM SIGSIM Simulation Digest, 27:1, (182-185), Online publication date: 1-Jul-1997.
- Booth C and Bruce D Stack-free process-oriented simulation Proceedings of the eleventh workshop on Parallel and distributed simulation, (182-185)
- Lee E and Sangiovanni-Vincentelli A Comparing models of computation Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, (234-241)
- Baker W and Newton A The maximal VHDL subset with a cycle-level abstraction Proceedings of the conference on European design automation, (470-475)
- Ghandeharizadeh S, Hull R and Jacobs D (1996). Heraclitus, ACM Transactions on Database Systems, 21:3, (370-426), Online publication date: 1-Sep-1996.
- Pronk C and Schönhacker M (1996). ISO/IEC 10514–1, the standard for Modula-2, ACM SIGPLAN Notices, 31:8, (74-83), Online publication date: 1-Aug-1996.
- Papaspyrou N (1996). A framework for programming denotational semantics in C++, ACM SIGPLAN Notices, 31:8, (16-25), Online publication date: 1-Aug-1996.
- Blikle A (1996). WHY DENOTATIONAL?, Fundamenta Informaticae, 28:1,2, (55-85), Online publication date: 1-Apr-1996.
- Colby C and Lee P Trace-based program analysis Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (195-207)
- Kaplan A and Wileden J (1995). Formalization and application of a unifying model for name management, ACM SIGSOFT Software Engineering Notes, 20:4, (161-172), Online publication date: 1-Oct-1995.
- Kaplan A and Wileden J Formalization and application of a unifying model for name management Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering, (161-172)
- Liang S, Hudak P and Jones M Monad transformers and modular interpreters Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (333-343)
- Avron A and Sasson N (1994). Stability, Sequentiality and Demand Driven Evaluation in Dataflow, Formal Aspects of Computing, 6:6, (620-642), Online publication date: 1-Dec-1994.
- Anglade S, Lacrampe J and Queinnec C (1994). Semantics of combinations in scheme, ACM SIGPLAN Lisp Pointers, VII:4, (15-20), Online publication date: 1-Oct-1994.
- Biswas S (1994). In-place updates in the presence of control operators, ACM SIGPLAN Lisp Pointers, VII:3, (283-293), Online publication date: 1-Jul-1994.
- Biswas S In-place updates in the presence of control operators Proceedings of the 1994 ACM conference on LISP and functional programming, (283-293)
- Harman M and Danicic S (1993). Projecting functional models of imperative programs, ACM SIGPLAN Notices, 28:11, (33-41), Online publication date: 1-Nov-1993.
- Ho K, Hilfinger P and Guesgen H Optimistic parallel discrete relaxation Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1, (268-273)
- Lawall J Proofs by structural induction using partial evaluation Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (155-166)
- Harrison R and Glass C Dynamic programming in a pure functional language Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (179-186)
- Yi K and Harrison W Automatic generation and management of interprocedural program analyses Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (246-259)
- Harper R and Lillibridge M Explicit polymorphism and CPS conversion Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (206-219)
- Lawall J and Danvy O Separating stages in the continuation-passing style transformation Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (124-136)
- Mizuno M and Schmidt D (1992). A security flow control algorithm and its denotational semantics correctness proof, Formal Aspects of Computing, 4:Suppl 1, (727-754), Online publication date: 1-Nov-1992.
- Widom J (1992). A denotational semantics for the Starburst production rule language, ACM SIGMOD Record, 21:3, (4-9), Online publication date: 1-Sep-1992.
- Read R, Fussell D and Silberschatz A A Multi-Resolution Relational Data Model Proceedings of the 18th International Conference on Very Large Data Bases, (139-150)
- Zajac R (1992). Inheritance and constraint-based grammar formalisms, Computational Linguistics, 18:2, (159-182), Online publication date: 1-Jun-1992.
- Jacob J (1992). Basic Theorems about Security, Journal of Computer Security, 1:3-4, (385-411), Online publication date: 1-May-1992.
- Ramsdell J (1992). An operational semantics for Scheme, ACM SIGPLAN Lisp Pointers, V:2, (6-10), Online publication date: 1-Apr-1992.
- Venkatesh G and Fischer C (1992). SPARE, IEEE Transactions on Software Engineering, 18:4, (304-318), Online publication date: 1-Apr-1992.
- Ammarguellat Z (1992). A Control-Flow Normalization Algorithm and its Complexity, IEEE Transactions on Software Engineering, 18:3, (237-251), Online publication date: 1-Mar-1992.
- Wand M and Oliva D Proving the correctness of storage representations Proceedings of the 1992 ACM conference on LISP and functional programming, (151-160)
- Tung S Interactive modular programming in Scheme Proceedings of the 1992 ACM conference on LISP and functional programming, (86-95)
- Wand M and Oliva D (1992). Proving the correctness of storage representations, ACM SIGPLAN Lisp Pointers, V:1, (151-160), Online publication date: 1-Jan-1992.
- Tung S (1992). Interactive modular programming in Scheme, ACM SIGPLAN Lisp Pointers, V:1, (86-95), Online publication date: 1-Jan-1992.
- Coen-Porisini A, De Paoli F, Ghezzi C and Mandrioli D (1991). Software Specialization Via Symbolic Execution, IEEE Transactions on Software Engineering, 17:9, (884-899), Online publication date: 1-Sep-1991.
- Abelson H, Dybvig R, Haynes C, Rozas G, Adams N, Friedman D, Kohlbecker E, Steele G, Bartley D, Halstead R, Oxley D, Sussman G, Brooks G, Hanson C, Pitman K, Wand M, Clinger W and Rees J (1991). Revised4 report on the algorithmic language scheme, ACM SIGPLAN Lisp Pointers, IV:3, (1-55), Online publication date: 1-Jul-1991.
- Weibel T and Gonnet G An algebra of properties Proceedings of the 1991 international symposium on Symbolic and algebraic computation, (352-359)
- Kishon A, Hudak P and Consel C (1991). Monitoring semantics, ACM SIGPLAN Notices, 26:6, (338-352), Online publication date: 1-Jun-1991.
- Irigoin F, Jouvelot P and Triolet R Semantical interprocedural parallelization Proceedings of the 5th international conference on Supercomputing, (244-251)
- Freedman R (1991). Testability of Software Components, IEEE Transactions on Software Engineering, 17:6, (553-564), Online publication date: 1-Jun-1991.
- Kishon A, Hudak P and Consel C Monitoring semantics Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (338-352)
- Hudak P and Young J (1991). Collecting interpretations of expressions, ACM Transactions on Programming Languages and Systems, 13:2, (269-290), Online publication date: 1-Apr-1991.
- Queinnec C and Serpette B A dynamic extent control operator for partial continuations Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (174-184)
- Consel C and Danvy O Static and dynamic semantics processing Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (14-24)
- Camilleri A (1990). Mechanizing CSP Trace Theory in Higher Order Logic, IEEE Transactions on Software Engineering, 16:9, (993-1004), Online publication date: 1-Sep-1990.
- Teitelbaum T and Chapman R (1990). Higher-order attribute grammars and editing environments, ACM SIGPLAN Notices, 25:6, (197-208), Online publication date: 1-Jun-1990.
- Teitelbaum T and Chapman R Higher-order attribute grammars and editing environments Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, (197-208)
- Katz M and Weise D Continuing into the future: on the interaction of futures and first-class continuations Proceedings of the 1990 ACM conference on LISP and functional programming, (176-184)
- Van Horebeek I and Lewi J (1990). Are constructive formal specifications less abstract?, ACM SIGPLAN Notices, 25:5, (60-68), Online publication date: 1-May-1990.
- Jiang X and Xu Y (1990). Diverse executable semantics definitions in NUSL and an implementation of functional types, ACM SIGPLAN Notices, 25:5, (39-52), Online publication date: 1-May-1990.
- Collavizza H Functional semantics of microprocessors at the microprogram level and correspondence with the machine instruction level Proceedings of the conference on European design automation, (52-56)
- Silbermann F and Jayaraman B Set abstraction in functional and logic programming Proceedings of the fourth international conference on Functional programming languages and computer architecture, (313-326)
- Lester D Stacklessness: compiling recursion for a distributed architecture Proceedings of the fourth international conference on Functional programming languages and computer architecture, (116-128)
- Jouvelot P and Dehbonei B (1989). Recursive Pattern Matching on concrete data types, ACM SIGPLAN Notices, 24:11, (84-93), Online publication date: 1-Nov-1989.
- Merrett T and Laliberte N (1989). Including Scalars in a Programming Language Based on the Relational Algebra, IEEE Transactions on Software Engineering, 15:11, (1437-1443), Online publication date: 1-Nov-1989.
- Cook W and Palsberg J (1989). A denotational semantics of inheritance and its correctness, ACM SIGPLAN Notices, 24:10, (433-443), Online publication date: 1-Oct-1989.
- Cook W and Palsberg J A denotational semantics of inheritance and its correctness Conference proceedings on Object-oriented programming systems, languages and applications, (433-443)
- Ramsdell J (1989). The Alonzo functional programming language, ACM SIGPLAN Notices, 24:9, (152-157), Online publication date: 11-Aug-1989.
- Boute R (1989). Representational and Denotational Semantics of Digital Systems, IEEE Transactions on Computers, 38:7, (986-999), Online publication date: 1-Jul-1989.
- Jouvelot P and Dehbonei B A unified semantic approach for the vectorization and parallelization of generalized reductions Proceedings of the 3rd international conference on Supercomputing, (186-194)
- Gumb R (1989). A first course in program verification and the semantics of programming languages, ACM SIGCSE Bulletin, 21:1, (146-150), Online publication date: 1-Feb-1989.
- Gumb R A first course in program verification and the semantics of programming languages Proceedings of the twentieth SIGCSE technical symposium on Computer science education, (146-150)
- Dershowitz N and Kaplan S Rewrite, rewrite, rewrite, rewrite, rewrite... Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (250-259)
- Queinnec C (1988). Dynamic extent objects, ACM SIGPLAN Lisp Pointers, 2:1, (11-21), Online publication date: 1-Jul-1988.
- Jayaraman B (1988). Semantics of EqL, IEEE Transactions on Software Engineering, 14:4, (472-480), Online publication date: 1-Apr-1988.
- Buneman P, Davidson S and Watters A A semantics for complex objects and approximate queries Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (305-314)
- Williams J and Wimmers E Sacrificing simplicity for convenience: Where do you draw the line? Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (169-179)
- Hudak P and Young J A collecting interpretation of expressions Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (107-118)
- Nielson F and Nielson R Automatic binding time analysis for a typed λ-calculus Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (98-106)
- Kamin S Inheritance in smalltalk-80: a denotational definition Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (80-87)
- Reddy U Objects as closures: abstract semantics of object-oriented languages Proceedings of the 1988 ACM conference on LISP and functional programming, (289-297)
- Meyer A and Riecke J Continuations may be unreasonable Proceedings of the 1988 ACM conference on LISP and functional programming, (63-71)
- McKenzie E and Snodgrass R (1987). Extending the relational algebra to support transaction time, ACM SIGMOD Record, 16:3, (467-478), Online publication date: 1-Dec-1987.
- McKenzie E and Snodgrass R Extending the relational algebra to support transaction time Proceedings of the 1987 ACM SIGMOD international conference on Management of data, (467-478)
- Lee P and Pleban U A realistic compiler generator based on high-level semantics: another progress report Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (284-295)
- Astesiano E and Reggio G (1987). Direct semantics of concurrent languages in the SMoLCS approach, IBM Journal of Research and Development, 31:5, (512-534), Online publication date: 1-Sep-1987.
- Letovsky S Program understanding with the lambda calculus Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1, (512-514)
- Rees J and Clinger W (1986). Revised3 report on the algorithmic language scheme, ACM SIGPLAN Notices, 21:12, (37-79), Online publication date: 1-Dec-1986.
- Lee P and Pleban U On the use of LISP in implementing denotational semantics Proceedings of the 1986 ACM conference on LISP and functional programming, (233-248)
- Ramsdell J The CURRY chip Proceedings of the 1986 ACM conference on LISP and functional programming, (122-131)
- Jouvelot P (1986). Designing new languages or new language manipulation systems using ML, ACM SIGPLAN Notices, 21:8, (40-52), Online publication date: 1-Aug-1986.
- Boehm H and Demers A (1986). Implementing RUSSELL, ACM SIGPLAN Notices, 21:7, (186-195), Online publication date: 1-Jul-1986.
- Royer V (1986). Transformations of denotational semantics in semantics directed compiler generation, ACM SIGPLAN Notices, 21:7, (68-73), Online publication date: 1-Jul-1986.
- Boehm H and Demers A Implementing RUSSELL Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (186-195)
- Royer V Transformations of denotational semantics in semantics directed compiler generation Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (68-73)
- Burn G, Hankin C and Abramsky S (1986). Strictness analysis for higher-order functions, Science of Computer Programming, 7:C, (249-278), Online publication date: 1-Jun-1986.
- Thomason R Paradoxes and semantic representation Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge, (225-239)
- Jones N and Mycroft A Data flow analysis of applicative programs using minimal function graphs Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (296-306)
- Hudak P and Smith L Para-functional programming Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (243-254)
- Meyer B The software knowledge base Proceedings of the 8th international conference on Software engineering, (158-165)
- Nielson F (1985). Program transformations in a denotational setting, ACM Transactions on Programming Languages and Systems, 7:3, (359-379), Online publication date: 1-Jul-1985.
- Halpern J, Williams J, Wimmers E and Winkler T Denotational semantics and rewrite rules for FP Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (108-120)
- Cartwright R Types as intervals Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (22-36)
- Rivières J and Smith B The implementation of procedurally reflective languages Proceedings of the 1984 ACM Symposium on LISP and functional programming, (331-347)
- Pereira F and Shieber S The semantics of grammar formalisms seen as computer languages Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics, (123-129)
- Clemmensen G and Oest O Formal specification and development of an ada compiler - a vdm case study Proceedings of the 7th international conference on Software engineering, (430-440)
- Halpern J, Meyer A and Trakhtenbrot B The semantics of local storage, or what makes the free-list free?(Preliminary Report) Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (245-257)
- Milos D, Pleban U and Loegel G Direct implementation of compiler specifications or the pascal p-code compiler revisited Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (196-207)
- Hudak P and Kranz D A combinator-based compiler for a functional language Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (122-132)
- Lansky A and Owicki S GEM Proceedings of the second annual ACM symposium on Principles of distributed computing, (198-212)
- Baiardi F, De Francesco N, Matteoli E, Stefanini S and Vaglini G (1983). Development of a debugger for a concurrent language, ACM SIGPLAN Notices, 18:8, (98-106), Online publication date: 1-Aug-1983.
- Baiardi F, De Francesco N, Matteoli E, Stefanini S and Vaglini G (1983). Development of a debugger for a concurrent language, ACM SIGSOFT Software Engineering Notes, 8:4, (98-106), Online publication date: 1-Aug-1983.
- Cohn A (1983). The Equivalence of Two Semantic Definitions, SIAM Journal on Computing, 12:2, (267-285), Online publication date: 1-May-1983.
- Baiardi F, De Francesco N, Matteoli E, Stefanini S and Vaglini G Development of a debugger for a concurrent language Proceedings of the symposium on High-level debugging, (98-106)
- Main M and Benson D (1983). Denotational semantics for "natural" language question-answering programs, Computational Linguistics, 9:1, (11-21), Online publication date: 1-Jan-1983.
- Baiardi F, Francesco N, Matteoli E, Stefanini S and Vaglini G Development of a debugger for a concurrent language Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging, (98-106)
- Nielson F (1982). A denotational framework for data flow analysis, Acta Informatica, 18:3, (265-287), Online publication date: 1-Dec-1982.
- Li W An operational semantics of multitasking and exception handling in Ada Proceedings of the AdaTEC Conference on Ada, (138-151)
- Louis G and Pirotte A A Denotational Definition of the Semantics of DRC, A Domain Relational Calculus Proceedings of the 8th International Conference on Very Large Data Bases, (348-356)
- Wilson W (1982). Beyond PROLOG, ACM SIGPLAN Notices, 17:9, (34-43), Online publication date: 1-Sep-1982.
- Cartwright R and Donahue J The semantics of lazy (and industrious) evaluation Proceedings of the 1982 ACM symposium on LISP and functional programming, (253-264)
- Clinger W Nondeterministic call by need is neither lazy nor by name Proceedings of the 1982 ACM symposium on LISP and functional programming, (226-234)
- Raskovsky M Denotational semantics as a specification of code generators Proceedings of the 1982 SIGPLAN symposium on Compiler construction, (230-244)
- Raskovsky M (1982). Denotational semantics as a specification of code generators, ACM SIGPLAN Notices, 17:6, (230-244), Online publication date: 1-Jun-1982.
- de Bakker J and Zucker J Denotational semantics of concurrency Proceedings of the fourteenth annual ACM symposium on Theory of computing, (153-158)
- Middelburg C (1982). The effect of the PDP-11 architecture on code generation for chill, ACM SIGPLAN Notices, 17:4, (149-157), Online publication date: 1-Apr-1982.
- Middelburg C (1982). The effect of the PDP-11 architecture on code generation for chill, ACM SIGARCH Computer Architecture News, 10:2, (149-157), Online publication date: 1-Mar-1982.
- Middelburg C The effect of the PDP-11 architecture on code generation for chill Proceedings of the first international symposium on Architectural support for programming languages and operating systems, (149-157)
- Komorowski H Partial evaluation as a means for inferencing data structures in an applicative language Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (255-267)
- Wand M Semantics-directed machine architecture Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (234-241)
- Burton F and Sleep M Executing functional programs on a virtual tree of processors Proceedings of the 1981 conference on Functional programming languages and computer architecture, (187-194)
- Lucas P (1981). Formal semantics of programming languages, IBM Journal of Research and Development, 25:5, (549-561), Online publication date: 1-Sep-1981.
- Lacroix M and Pirotte A Data structures for CAD object description Proceedings of the 18th Design Automation Conference, (653-659)
- Berg H Firmware testing and test data selection Proceedings of the May 4-7, 1981, national computer conference, (75-80)
- Polak W Program verification based on denotation semantics Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (149-158)
- Discepolo A Towards a practical specification language Proceedings of the ACM '81 conference, (144-153)
- Løvengreen H and Bjørner D On a formal model of the tasking concept in Ada Proceedings of the ACM-SIGPLAN symposium on Ada programming language, (213-222)
- Cleaveland J (1980). Mathematical specifications, ACM SIGPLAN Notices, 15:12, (31-42), Online publication date: 1-Dec-1980.
- Løvengreen H and Bjørner D (1980). On a formal model of the tasking concept in Ada, ACM SIGPLAN Notices, 15:11, (213-222), Online publication date: 1-Nov-1980.
- Ashcroft E and Wadge B (1980). Some common misconceptions about Lucid, ACM SIGPLAN Notices, 15:10, (15-26), Online publication date: 1-Oct-1980.
- Nishida T and Doshita S Hierarchical meaning representation and analysis of natural language documents Proceedings of the 8th conference on Computational linguistics, (85-92)
- Muchnick S and Pleban U A semantic comparison of LISP and SCHEME Proceedings of the 1980 ACM conference on LISP and functional programming, (56-64)
- Boute R (1980). Simplifying ADA by removing limitations, ACM SIGPLAN Notices, 15:2, (17-29), Online publication date: 1-Feb-1980.
- Sethi R A case study in specifying the semantics of a programming language Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (117-130)
- Løvengreen H and Bjørner D On a formal model of the tasking concept in Ada Proceedings of the ACM-SIGPLAN symposium on The ADA programming language, (213-222)
- Vassiliou Y Null values in data base management a denotational semantics approach Proceedings of the 1979 ACM SIGMOD international conference on Management of data, (162-169)
- Jones N and Muchnick S Flow analysis and optimization of LISP-like structures Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (244-256)
Index Terms
- Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Recommendations
A Denotational Semantics for Circus
Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to ...