TinkerType: a language for playing with formal systems

DOI10.1017/S0956796802004550MaRDI QIDQ4457834zbMATHOpenAlexFDO

Authors Michael Y. Levin, Benjamin C. Pierce

Publication date 17 March 2004

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796802004550

zbMATH Keywords

typed lambda-calculi

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• Ruler: Programming Type Rules
• A Modular Type Reconstruction Algorithm
• Using typed lambda calculus to implement formal systems on a machine
• scientific article; zbMATH DE number 559219
• Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)

Cited in

(5)

• Ruler: Programming Type Rules
• Ott: Effective tool support for the working semanticist
• A Rewriting Logic Approach to Type Inference
• TinkerType
• Implicit propagation in structural operational semantics

Describes a project that uses

Uses Software

• Automath

This page was built for publication: TinkerType: a language for playing with formal systems

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