Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Semantics of programming languages: structures and techniquesAugust 1992
Publisher:
  • MIT Press
  • 55 Hayward St.
  • Cambridge
  • MA
  • United States
ISBN:978-0-262-07143-7
Published:31 August 1992
Pages:
419
Skip Bibliometrics Section
Reflects downloads up to 08 Feb 2025Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Zhou L, Wan Q and Oliveira B (2024). Full Iso-Recursive Types, Proceedings of the ACM on Programming Languages, 8:OOPSLA2, (192-221), Online publication date: 8-Oct-2024.
  2. ACM
    Goncharov S, Milius S, Tsampas S and Urbat H Bialgebraic Reasoning on Higher-order Program Equivalence Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-15)
  3. ACM
    Blouin A (2024). A Type System for Flexible User Interactions Handling, Proceedings of the ACM on Human-Computer Interaction, 8:EICS, (1-27), Online publication date: 17-Jun-2024.
  4. ACM
    Zhang L, Liu C, Xu Z, Chen S, Fan L, Chen B and Liu Y Has My Release Disobeyed Semantic Versioning? Static Detection Based on Semantic Differencing Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, (1-12)
  5. Fortas A, Kerkouche E and Chaoui A (2022). Formal verification of IoT applications using rewriting logic, Science of Computer Programming, 222:C, Online publication date: 1-Oct-2022.
  6. ACM
    Kavvos G, Morehouse E, Licata D and Danner N (2019). Recurrence extraction for functional programs through call-by-push-value, Proceedings of the ACM on Programming Languages, 4:POPL, (1-31), Online publication date: 1-Jan-2020.
  7. ACM
    Fu Y, Liu J, Shi X, Tsai M, Wang B and Yang B Signed Cryptographic Program Verification with Typed CryptoLine Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, (1591-1606)
  8. ACM
    Nishizaki S ML Polymorphism of Linear Lambda Calculus with First-class Continuations Proceedings of the 2019 8th International Conference on Software and Computer Applications, (189-193)
  9. Guagliardo P and Libkin L (2017). A formal semantics of SQL queries, its validation, and applications, Proceedings of the VLDB Endowment, 11:1, (27-39), Online publication date: 1-Sep-2017.
  10. Asada K, Sato R and Kobayashi N (2017). Verifying relational properties of functional programs by first-order refinement, Science of Computer Programming, 137:C, (2-62), Online publication date: 1-Apr-2017.
  11. Murawski A and Tzevelekos N (2016). Nominal Game Semantics, Foundations and Trends in Programming Languages, 2:4, (191-269), Online publication date: 1-Mar-2016.
  12. (2016). Certain answers as objects and knowledge, Artificial Intelligence, 232:C, (1-19), Online publication date: 1-Mar-2016.
  13. Libkin L How to define certain answers Proceedings of the 24th International Conference on Artificial Intelligence, (4282-4288)
  14. ACM
    Gheerbrant A, Libkin L and Sirangelo C (2014). Naïve Evaluation of Queries over Incomplete Databases, ACM Transactions on Database Systems, 39:4, (1-42), Online publication date: 30-Dec-2015.
  15. Tamura G, Casallas R, Cleve A and Duchien L (2014). QoS contract preservation through dynamic reconfiguration, Science of Computer Programming, 94:P3, (307-332), Online publication date: 1-Nov-2014.
  16. ACM
    Jung A (2014). Semantics column, ACM SIGLOG News, 1:2, (25-37), Online publication date: 14-Oct-2014.
  17. Nadas A, Levendovszky T, Jackson E, Madari I and Sztipanovits J (2014). A model-integrated authoring environment for privacy policies, Science of Computer Programming, 89:PB, (105-125), Online publication date: 1-Sep-2014.
  18. ACM
    Nunes-Harwitt A Eager Evaluation Isn't Eager Enough A Transformation Based Approach to Semantics-Directed Code Generation Proceedings of ILC 2014 on 8th International Lisp Conference, (79-86)
  19. Libkin L Certain answers as objects and knowledge Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, (328-337)
  20. Backes M, Hriţcu C and Maffei M (2014). Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations, Journal of Computer Security, 22:2, (301-353), Online publication date: 1-Mar-2014.
  21. ACM
    Gammie P (2013). Synchronous digital circuits as functional programs, ACM Computing Surveys, 46:2, (1-27), Online publication date: 1-Nov-2013.
  22. ACM
    Purandare R, Dwyer M and Elbaum S Optimizing monitoring of finite state properties through monitor compaction Proceedings of the 2013 International Symposium on Software Testing and Analysis, (280-290)
  23. ACM
    Gheerbrant A, Libkin L and Sirangelo C When is naive evaluation possible? Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems, (75-86)
  24. ACM
    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)
  25. ACM
    Thielecke H Functional semantics of parsing actions, and left recursion elimination as continuation passing Proceedings of the 14th symposium on Principles and practice of declarative programming, (91-102)
  26. Schmidt D (2012). Inverse-limit and topological aspects of abstract interpretation, Theoretical Computer Science, 430, (23-42), Online publication date: 1-Apr-2012.
  27. Blom C, de Groote P, Winter Y and Zwarts J Implicit arguments Proceedings of the 18th Amsterdam colloquim conference on Logic, Language and Meaning, (240-250)
  28. ACM
    Libkin L Incomplete information and certain answers in general data models Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (59-70)
  29. ACM
    Chitil O A semantics for lazy assertions Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation, (141-150)
  30. ACM
    Bengtson J, Bhargavan K, Fournet C, Gordon A and Maffeis S (2011). Refinement types for secure implementations, ACM Transactions on Programming Languages and Systems, 33:2, (1-45), Online publication date: 1-Jan-2011.
  31. Beaucamps P, Gnaedig I and Marion J Behavior abstraction in malware analysis Proceedings of the First international conference on Runtime verification, (168-182)
  32. ACM
    Backes M, Maffei M and Unruh D Computationally sound verification of source code Proceedings of the 17th ACM conference on Computer and communications security, (387-398)
  33. Agrawal P, Sarma A, Ullman J and Widom J (2010). Foundations of uncertain-data integration, Proceedings of the VLDB Endowment, 3:1-2, (1080-1090), Online publication date: 1-Sep-2010.
  34. Clouston R (2010). Binding in Nominal Equational Logic, Electronic Notes in Theoretical Computer Science (ENTCS), 265, (259-276), Online publication date: 1-Sep-2010.
  35. Berger M and Tratt L Program logics for homogeneous meta-programming Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning, (64-81)
  36. ACM
    Bhargavan K, Fournet C and Gordon A Modular verification of security protocol code by typing Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (445-456)
  37. ACM
    Bhargavan K, Fournet C and Gordon A (2010). Modular verification of security protocol code by typing, ACM SIGPLAN Notices, 45:1, (445-456), Online publication date: 2-Jan-2010.
  38. 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.
  39. Escardó M (2009). Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (219-242), Online publication date: 1-Aug-2009.
  40. Brown D and Pucella R (2009). Categories of Timed Stochastic Relations, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (193-217), Online publication date: 1-Aug-2009.
  41. Schmidt D (2009). Abstract Interpretation From a Denotational-semantics Perspective, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (19-37), Online publication date: 1-Aug-2009.
  42. 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.
  43. Escardó M and Ho W (2009). Operational domain theory and topology of sequential programming languages, Information and Computation, 207:3, (411-437), Online publication date: 1-Mar-2009.
  44. Spreen D, Xu L and Mao X (2008). Information systems revisited – the general continuous case, Theoretical Computer Science, 405:1-2, (176-187), Online publication date: 1-Oct-2008.
  45. ACM
    Paolini L and Piccolo M Semantically linear programming languages Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, (97-107)
  46. Cuccuru A, Mraidha C, Terrier F and Grard S Enhancing UML extensions with operational semantics behaviored profiles with templates Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems, (271-285)
  47. Huima A Implementing conformiq Qtronic Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems, (1-12)
  48. Filinski A (2007). On the relations between monadic semantics, Theoretical Computer Science, 375:1-3, (41-75), Online publication date: 20-Apr-2007.
  49. Pym D and Tofts C (2007). Systems Modelling via Resources and Processes, Electronic Notes in Theoretical Computer Science (ENTCS), 172, (545-587), Online publication date: 1-Apr-2007.
  50. ACM
    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)
  51. ACM
    Pitts A and Shinwell M (2007). Generative unbinding of names, ACM SIGPLAN Notices, 42:1, (85-95), Online publication date: 17-Jan-2007.
  52. Pym D and Tofts C (2006). A Calculus and logic of resources and processes, Formal Aspects of Computing, 18:4, (495-517), Online publication date: 1-Dec-2006.
  53. Diskin Z and Dingel J Mappings, maps and tables Proceedings of the 9th international conference on Model Driven Engineering Languages and Systems, (230-244)
  54. Honda K, Berger M and Yoshida N Descriptive and relative completeness of logics for higher-order functions Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II, (360-371)
  55. Crolard T, Lacas S and Valarcher P (2006). On the expressive power of the loop language, Nordic Journal of Computing, 13:1, (46-57), Online publication date: 1-Jun-2006.
  56. ACM
    Pitts A (2006). Alpha-structural recursion and induction, Journal of the ACM, 53:3, (459-506), Online publication date: 1-May-2006.
  57. ACM
    Ernst E, Ostermann K and Cook W (2006). A virtual class calculus, ACM SIGPLAN Notices, 41:1, (270-282), Online publication date: 12-Jan-2006.
  58. ACM
    Ernst E, Ostermann K and Cook W A virtual class calculus Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (270-282)
  59. Harrison W A simple semantics for polymorphic recursion Proceedings of the Third Asian conference on Programming Languages and Systems, (37-51)
  60. ACM
    Berger M, Honda K and Yoshida N A logical analysis of aliasing in imperative higher-order functions Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, (280-293)
  61. ACM
    Berger M, Honda K and Yoshida N (2005). A logical analysis of aliasing in imperative higher-order functions, ACM SIGPLAN Notices, 40:9, (280-293), Online publication date: 12-Sep-2005.
  62. Pitts A Alpha-structural recursion and induction Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics, (17-34)
  63. Spreen D (2005). The largest Cartesian closed category of domains, considered constructively, Mathematical Structures in Computer Science, 15:2, (299-321), Online publication date: 1-Apr-2005.
  64. Escardó M (2004). Synthetic Topology, Electronic Notes in Theoretical Computer Science (ENTCS), 87, (21-156), Online publication date: 1-Nov-2004.
  65. ACM
    Honda K From process logic to program logic Proceedings of the ninth ACM SIGPLAN international conference on Functional programming, (163-174)
  66. ACM
    Honda K (2004). From process logic to program logic, ACM SIGPLAN Notices, 39:9, (163-174), Online publication date: 19-Sep-2004.
  67. ACM
    Honda K and Yoshida N A compositional logic for polymorphic higher-order functions Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, (191-202)
  68. ACM
    Krstić S and Matthews J Semantics of the reFL language Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, (32-42)
  69. McBurney P and Parsons S A Denotational Semantics for Deliberation Dialogues Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1, (86-93)
  70. McBurney P and Parsons S A denotational semantics for deliberation dialogues Proceedings of the First international conference on Argumentation in Multi-Agent Systems, (162-175)
  71. Yoshida N, Berger M and Honda K (2004). Strong normalisation in the π-calculus, Information and Computation, 191:2, (145-202), Online publication date: 15-Jun-2004.
  72. ACM
    Despeyroux T Practical semantic analysis of web sites and documents Proceedings of the 13th international conference on World Wide Web, (685-693)
  73. ACM
    Arenas M and Libkin L (2004). A normal form for XML documents, ACM Transactions on Database Systems, 29:1, (195-232), Online publication date: 1-Mar-2004.
  74. 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.
  75. ACM
    Menon V, Pingali K and Mateev N (2003). Fractal symbolic analysis, ACM Transactions on Programming Languages and Systems, 25:6, (776-813), Online publication date: 1-Nov-2003.
  76. Lynch N, Segala R and Vaandrager F (2003). Hybrid I/O automata, Information and Computation, 185:1, (105-157), Online publication date: 25-Aug-2003.
  77. Khasidashvili Z and Glauert J Stable computational semantics of conflict-free rewrite systems (partial orders with duplication) Proceedings of the 14th international conference on Rewriting techniques and applications, (467-482)
  78. Levin M and Pierce B (2003). TinkerType: a language for playing with formal systems, Journal of Functional Programming, 13:2, (295-316), Online publication date: 1-Mar-2003.
  79. Schmidt D Programming language semantics Encyclopedia of Computer Science, (1463-1466)
  80. ACM
    PašaliΕ E, Taha W and Sheard T Tagless staged interpreters for typed languages Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, (218-229)
  81. ACM
    PašaliΕ E, Taha W and Sheard T (2002). Tagless staged interpreters for typed languages, ACM SIGPLAN Notices, 37:9, (218-229), Online publication date: 17-Sep-2002.
  82. Gabbay M and Pitts A (2002). A New Approach to Abstract Syntax with Variable Binding, Formal Aspects of Computing, 13:3-5, (341-363), Online publication date: 1-Jul-2002.
  83. ACM
    Arenas M and Libkin L A normal form for XML documents Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (85-96)
  84. Künzi H and Schellekens M (2002). On the Yoneda completion of a quasi-metric space, Theoretical Computer Science, 278:1-2, (159-194), Online publication date: 6-May-2002.
  85. Hennessy M (2002). A fully abstract denotational semantics for the π-calculus, Theoretical Computer Science, 278:1-2, (53-89), Online publication date: 6-May-2002.
  86. 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.
  87. Schmidt D Structure-preserving binary relations for program abstraction The essence of computation, (245-265)
  88. ACM
    McDowell R and Miller D (2002). Reasoning with higher-order abstract syntax in a logical framework, ACM Transactions on Computational Logic, 3:1, (80-136), Online publication date: 1-Jan-2002.
  89. ACM
    Sperber M (2001). Developing a stage lighting system from scratch, ACM SIGPLAN Notices, 36:10, (122-133), Online publication date: 1-Oct-2001.
  90. ACM
    Sperber M Developing a stage lighting system from scratch Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, (122-133)
  91. Van Eijck J (2001). Incremental Dynamics, Journal of Logic, Language and Information, 10:3, (319-351), Online publication date: 1-Jun-2001.
  92. Berger M, Honda K and Yoshida N Sequentiality and the π-calculus Proceedings of the 5th international conference on Typed lambda calculi and applications, (29-45)
  93. Yoshida N and Hennessy M Assigning Types to Processes Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
  94. Simpson A and Plotkin G Complete Axioms for Categorical Fixed-Point Operators Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
  95. ACM
    Stevenson D Exploring an information-based approach to computation and computational complexity Proceedings of the 38th annual ACM Southeast Conference, (42-50)
  96. Schmidt D (2000). Induction, Domains, Calculi, Higher-Order and Symbolic Computation, 13:1-2, (89-101), Online publication date: 1-Apr-2000.
  97. ACM
    Siff M, Chandra S, Ball T, Kunchithapadam K and Reps T (1999). Coping with type casts in C, ACM SIGSOFT Software Engineering Notes, 24:6, (180-198), Online publication date: 1-Nov-1999.
  98. Siff M, Chandra S, Ball T, Kunchithapadam K and Reps T Coping with type casts in C Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering, (180-198)
  99. Bjørner D and Cuéllar J (1999). Software engineering education, Annals of Software Engineering, 6:1-4, (365-409), Online publication date: 1-Apr-1999.
  100. ACM
    Bruce K Formal semantics and interpreters in a principles of programming languages course The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, (331-335)
  101. ACM
    Bruce K (1999). Formal semantics and interpreters in a principles of programming languages course, ACM SIGCSE Bulletin, 31:1, (331-335), Online publication date: 1-Mar-1999.
  102. Braüner T (1998). A Simple Adequate Categorical Model for PCF, II, Fundamenta Informaticae, 33:4, (339-368), Online publication date: 1-Dec-1998.
  103. ACM
    Jacobs B, van den Berg J, Huisman M, van Berkum M, Hensel U and Tews H (1998). Reasoning about Java classes, ACM SIGPLAN Notices, 33:10, (329-340), Online publication date: 1-Oct-1998.
  104. ACM
    Jacobs B, van den Berg J, Huisman M, van Berkum M, Hensel U and Tews H Reasoning about Java classes Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (329-340)
  105. Ellman T and Murata T (1998). Deductive Synthesis of Numerical Simulation Programs fromNetworks of Algebraic and Ordinary Differential Equations, Automated Software Engineering, 5:3, (291-319), Online publication date: 1-Jul-1998.
  106. Schmidt D (1998). Trace-Based Abstract Interpretation of Operational Semantics, Lisp and Symbolic Computation, 10:3, (237-271), Online publication date: 1-May-1998.
  107. ACM
    Haynes C (1998). Experience with an analytic approach to teaching programming languages, ACM SIGCSE Bulletin, 30:1, (350-354), Online publication date: 1-Mar-1998.
  108. ACM
    Haynes C Experience with an analytic approach to teaching programming languages Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education, (350-354)
  109. ACM
    Smith G and Volpano D Secure information flow in a multi-threaded imperative language Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (355-364)
  110. ACM
    Nishimura S Static typing for dynamic messages Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (266-278)
  111. ACM
    Wand M and Sullivan G Denotational semantics using an operationally-based term model Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (386-399)
  112. ACM
    Biswas S A demand-driven set-based analysis Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (372-385)
  113. ACM
    Papaspyrou N (1996). A framework for programming denotational semantics in C++, ACM SIGPLAN Notices, 31:8, (16-25), Online publication date: 1-Aug-1996.
  114. Hillebrand G and Kanellakis P On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  115. Abadi M and Fiore M Syntactic Considerations on Recursive Types Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  116. McCusker G Games and Full Abstraction for FPC Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  117. Escardo M and Edalat A Real PCF extended with integration Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
  118. ACM
    Ferreira W, Hennessy M and Jeffrey A (1996). A theory of weak bisimulation for core CML, ACM SIGPLAN Notices, 31:6, (201-212), Online publication date: 15-Jun-1996.
  119. ACM
    Ferreira W, Hennessy M and Jeffrey A A theory of weak bisimulation for core CML Proceedings of the first ACM SIGPLAN international conference on Functional programming, (201-212)
  120. ACM
    Wong L (1995). An introduction to Remy's fast polymorphic record projection, ACM SIGMOD Record, 24:3, (34-39), Online publication date: 1-Sep-1995.
  121. ACM
    Liu Y and Teitelbaum T Caching intermediate results for program improvement Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (190-201)
  122. ACM
    Libkin L Normalizing incomplete databases Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (219-230)
  123. ACM
    Wong L (1995). Polymorphic queries across sets, bags, and lists, ACM SIGPLAN Notices, 30:4, (39-44), Online publication date: 1-Apr-1995.
  124. ACM
    Riecke J and Viswanathan R Isolating side effects in sequential languages Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (1-12)
  125. Pustejovsky J and Bouillon P On the proper role of coercion in semantic typing Proceedings of the 15th conference on Computational linguistics - Volume 2, (706-711)
  126. ACM
    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.
  127. ACM
    Biswas S In-place updates in the presence of control operators Proceedings of the 1994 ACM conference on LISP and functional programming, (283-293)
  128. ACM
    Wong L Normal forms and conservative properties for query languages over collection types Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (26-36)
  129. ACM
    Riecke J Delimiting the scope of effects Proceedings of the conference on Functional programming languages and computer architecture, (146-155)
  130. ACM
    Chirimar J, Gunter C and Riecke J Proving memory management invariants for a language based on linear logic Proceedings of the 1992 ACM conference on LISP and functional programming, (139-150)
  131. ACM
    Chirimar J, Gunter C and Riecke J (1992). Proving memory management invariants for a language based on linear logic, ACM SIGPLAN Lisp Pointers, V:1, (139-150), Online publication date: 1-Jan-1992.
  132. ACM
    Kessel M and Atkinson C Morescient GAI for Software Engineering, ACM Transactions on Software Engineering and Methodology, 0:0
Contributors
  • University of Illinois Urbana-Champaign

Reviews

Richard John Botting

The current theory of how to define what a language means is presented. This text has 11 chapters and covers the main areas: the &lgr;-calculus, call-by-value versus call-by-name, recursive definitions, simple types, theories of finite approximations, full abstraction and adequacy, structured types, <__?__Pub Fmt nolinebreak>domain<__?__Pub Fmt /nolinebreak> theory, universal types, type inference, generic definitions, and polymorphism (subtype and parametric). The book develops from uncomplicated models but ends with highly abstract theories (such as Grothendieck fibrations). The length of the book fits the subject. The author uses “natural operational semantics,” which is also called “structural operational semantics” and is derived from the use of the mathematics of denotational semantics to define the behavior of a program. Semantics are given as tables of derivation rules for equations, relations, or type judgments. Instead of repeating previous rules, the author mentions their source in an informal discussion (p.<__?__Pub Fmt interword-space>xvii). This approach is a good idea. It would be even better to make the cross-references formal and highly visible—a mathematical version of the #include, IMPORT, or USE/WITH clauses. The preface claims that the “book is designed as a text for upper-level and graduate-level students from all areas of computer science.” A familiarity with discrete mathematics is needed, and experience of category theory would help. The book has many exercises. The later chapters go well beyond the needs of upper-level students. The last four chapters, on domain theory and polymorphism, describe recent work and make the book a useful addition to a research library. The paradoxes that crop up are only mentioned in the end-of-chapter notes. These chapters are suited to a graduate seminar, not to undergraduate lectures. Excellent bibliographic notes are provided in each chapter, and the author gives 274 references to papers, books, and theses at the end of the book. The book has two indexes, an index of notations and an index of subjects. These looked adequate at first glance, but I could not find several notations and subjects that I needed as I read the text. Lists of figures and of tables are given, but many diagrams of categories in theorems and definitions are not listed as figures. The typography is good, but the book lacks editing. In the first part of the book, terms are sometimes used without definition or before they are defined. The phrases “semantic function” and “meaning function” appear on page 15 but are not in the index and, as far as I can see, are never defined. Similarly, “equivalence classes” are mentioned on page 32 but are not defined, although “equivalence relations” are defined on page 36. I noted a half dozen typos: the scrambled subscripts on the last line of page 79 got in the way of under<__?__Pub Fmt hyphen-point>standing. Gunter gives no definition of the meaning of syntactic definitions. Syntactic precision is sacrificed on the altar of parsimony. So, informal rules clarify the parsing of the languages defined. The Programming language for Computable Functions (PCF) defined on page 100 includes expressions such as “succ(true)” and “zero__?__(false).” No semantics are provided for these until 128 pages later, where, by default, they are defined to evaluate to “tyerr” [sic]. The book is concerned almost entirely with the semantics of applicative languages like LISP and ML. Most programmers will find that their language is never mentioned. Ada, however, is mentioned briefly. Algol 60 is the only non–LISP-like example. On page 253, the author states that <__?__Pub Fmt nolinebreak>“ALGOL<__?__Pub Fmt /nolinebreak> 60 has the typed &lgr;-calculus as a sublanguage." It does not. Hennessy's text [1] gives an introduction to natural semantics aimed at undergraduates. Meyer's book [2] will appeal more to practitioners. These two texts use more familiar languages. They cover less than half of the material in <__?__Pub Caret>Gunter's book, since they do not tackle the categorical and domain theories of data types. Gunter's text is a good graduate text and reference for researchers in languages.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Recommendations