Static semantics, types, and binding time analysis

DOI10.1016/0304-3975(91)90301-HzbMath0796.68050MaRDI QIDQ1179698

Neil D. Jones

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

dynamic semanticspartial evaluationtype systemsmixed computationstatic semanticsbinding time analysiscompiler generatorinterpreter programtype checkertype errors

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)

Related Items (2)

On Extracting Static Semantics ⋮ Schematic program proofs with abstract execution. Theory and applications

Uses Software

• Unnamed Item
• ALGOL 60
• Refal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics of data types. International Symposium, Sophia-Antipolis, France, June 27-29, 1984. Proceedings
• A structured approach to static semantics correctness
• Semantics-directed compiler generation. Proceedings of a Workshop, Aarhus, Denmark, January 14-18, 1980
• A denotational framework for data flow analysis
• Mixed computation: potential applications and problems for study
• TEMPO: A unified treatment of binding time and parameter passing concepts in programming languages
• A theory of type polymorphism in programming
• A structural approach to operational semantics
• Control Flow Aspects of Semantics-Directed Compiling
• The Type Theory of PL/CV3
• The concept of a supercompiler
• The remaining trouble spots in ALGOL 60

This page was built for publication: Static semantics, types, and binding time analysis