A Rewriting Logic Approach to Type Inference

DOI10.1007/978-3-642-03429-9_10zbMath1253.68211MaRDI QIDQ3184729

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

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

68Q55: Semantics in the theory of computing

68Q42: Grammars and rewriting systems

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

An overview of the K semantic framework

Uses Software

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

Cites Work

• Unnamed Item
• The rewriting logic semantics project
• Conditional rewriting logic as a unified model of concurrency
• The revised report on the syntactic theories of sequential control and state
• A theory of type polymorphism in programming
• A syntactic approach to type soundness
• Continuations: A mathematical semantics for handling full jumps
• Maude: specification and programming in rewriting logic
• LEAN: An intermediate language based on graph rewriting
• The origins of structural operational semantics
• Towards a mechanized metatheory of standard ML
• An Efficient Unification Algorithm
• TinkerType: a language for playing with formal systems
• Editorial
• Evolving Algebras 1993: Lipari Guide
• Introduction to generalized type systems
• Ott
• Automated Reasoning
• Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
• Theorem Proving in Higher Order Logics
• A Rewriting Semantics for Type Inference