A Rewriting Semantics for Type Inference

DOI10.1007/978-3-540-71316-6_29MaRDI QIDQ5756511zbMATH OpenOpenAlexFDO

Authors George Kuan, Robert Bruce Findler, David MacQueen

Publication date 4 September 2007

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71316-6_29

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• A Rewriting Logic Approach to Type Inference
• Simple type inference for term graph rewriting systems
• scientific article; zbMATH DE number 177779
• A rewrite-based type discipline for a subset of computer algebra
• A semantics for static type inference

Cited in

(14)

• Rewrite systems on a lattice of types
• scientific article; zbMATH DE number 1705161 (Why is no real title available?)
• Symbolic abstract data type inference
• A Rewriting Logic Approach to Type Inference
• scientific article; zbMATH DE number 4126684 (Why is no real title available?)
• scientific article; zbMATH DE number 1265030 (Why is no real title available?)
• An Extension of the Formulas-as-Types Paradigm
• scientific article; zbMATH DE number 1948390 (Why is no real title available?)
• scientific article; zbMATH DE number 827981 (Why is no real title available?)
• Type Inference for Correspondence Types
• Algebraic semantics of rewriting terms and types
• Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules
• Type inference with recursive types: Syntax and semantics
• A correspondence between type checking via reduction and type checking via evaluation

Describes a project that uses

Uses Software

• Stratego

This page was built for publication: A Rewriting Semantics for Type Inference

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