A Rewriting Logic Approach to Type Inference

DOI10.1007/978-3-642-03429-9_10MaRDI QIDQ3184729zbMATH OpenOpenAlexFDO

Authors Chucky Ellison, Traian Şerbănuţă, Grigore Roşu

Publication date 22 October 2009

Published in Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03429-9_10

Mathematics Subject Classification ID

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

Recommendations

• The rewriting logic semantics project
• The polymorphic rewriting-calculus [type checking vs. type inference]
• The rewriting logic semantics project: a progress report
• The rewriting logic semantics project: a progress report
• The rewriting logic semantics project

Cites work

• scientific article; zbMATH DE number 1693507 (Why is no real title available?)
• A Rewriting Semantics for Type Inference
• A syntactic approach to type soundness
• A theory of type polymorphism in programming
• An Efficient Unification Algorithm
• Automated Reasoning
• Conditional rewriting logic as a unified model of concurrency
• Continuations: A mathematical semantics for handling full jumps
• Editorial
• Evolving Algebras 1993: Lipari Guide
• Introduction to generalized type systems
• LEAN: An intermediate language based on graph rewriting
• Maude: specification and programming in rewriting logic
• Ott, effective tool support for the working semanticist
• Pure type systems in rewriting logic: specifying typed higher-order languages in a first-order logical framework
• The origins of structural operational semantics
• The revised report on the syntactic theories of sequential control and state
• The rewriting logic semantics project
• Theorem Proving in Higher Order Logics
• TinkerType: a language for playing with formal systems
• Towards a mechanized metatheory of Standard ML

Cited in

(18)

• The rewriting logic semantics project: a progress report
• The rewriting logic semantics project: a progress report
• Twenty years of rewriting logic
• Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules
• Pure type systems in rewriting logic: specifying typed higher-order languages in a first-order logical framework
• Operationally-based program equivalence proofs using LCTRSs
• Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
• scientific article; zbMATH DE number 1265030 (Why is no real title available?)
• scientific article; zbMATH DE number 5198991 (Why is no real title available?)
• A Rewriting Semantics for Type Inference
• Rewrite systems on a lattice of types
• Optimizing optimal reduction
• Polymorphic types in functional logic programming
• scientific article; zbMATH DE number 4126684 (Why is no real title available?)
• scientific article; zbMATH DE number 827981 (Why is no real title available?)
• From rewriting logic, to programming language semantics, to program verification
• An Extension of the Formulas-as-Types Paradigm
• An overview of the K semantic framework

Describes a project that uses

Uses Software

• K Prover
• ASF+SDF
• PoplMark
• OCaml
• Maude
• TinkerType
• Stratego
• ML
• Ott

This page was built for publication: A Rewriting Logic Approach to Type Inference

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