Principal Types for Nominal Theories

DOI10.1007/978-3-642-22953-4_14zbMath1241.68048OpenAlexW1780022809MaRDI QIDQ3088280

Maribel Fernández, Elliot Fairweather, Murdoch James Gabbay

Publication date: 19 August 2011

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22953-4_14

zbMATH Keywords

polymorphismrewritingtype inferencebinding

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Nominal essential intersection types

Uses Software

• Freshml

Cites Work

• Unnamed Item
• Intersection type assignment systems with higher-order algebraic rewriting
• The system \({\mathcal F}\) of variable types, fifteen years later
• Normalization results for typeable rewrite systems
• Nominal unification
• Nominal rewriting
• A filter lambda model and the completeness of type assignment
• A Nominal Axiomatization of the Lambda Calculus
• Curry-Style Types for Nominal Terms
• Nominal (Universal) Algebra: Equational Logic with Names and Binding
• Pairing Without Conventional Restraints
• Nominal system T
• FreshML

This page was built for publication: Principal Types for Nominal Theories