Extensible denotational language specifications

DOI10.1007/3-540-57887-0_99MaRDI QIDQ4490731zbMATH OpenFDO

Authors Robert Cartwright, Matthias Felleisen

Publication date 20 July 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57887-0_99

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 3956413
• Programming Denotational Semantics II
• scientific article; zbMATH DE number 3902017
• Executable semantic descriptions
• scientific article; zbMATH DE number 3890703

Cited in

(12)

• Inserting injection operations to denotational specifications
• Evolution of rule-based programs
• Modular structural operational semantics
• Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics
• scientific article; zbMATH DE number 1241701 (Why is no real title available?)
• On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation
• Specification languages
• Not by equations alone. Reasoning with extensible effects
• No value restriction is needed for algebraic effects and handlers
• Constructing language processors with algebra combinators
• Galois connecting call-by-value and call-by-name
• Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation

This page was built for publication: Extensible denotational language specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4490731)