Polymorphic Abstract Syntax via Grothendieck Construction

DOI10.1007/978-3-642-19805-2_26MaRDI QIDQ3000622zbMATH OpenOpenAlexFDO

Authors Makoto Hamana

Publication date 19 May 2011

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19805-2_26

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• Higher-order abstract syntax in type theory
• Full abstraction for polymorphic \(\pi \)-calculus
• Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
• Higher-order abstract syntax in Isabelle/HOL
• Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
• Types and full abstraction for polyadic \(\pi\)-calculus
• scientific article; zbMATH DE number 2185657
• scientific article; zbMATH DE number 1263381
• scientific article; zbMATH DE number 4154448
• Programming Languages and Systems

Cited in

(6)

• How to prove decidability of equational theories with second-order computation analyser SOL
• Theory and practice of second-order rewriting: foundation, evolution, and SOL
• Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
• Abstract clones for abstract syntax
• Functorial data migration
• Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding

This page was built for publication: Polymorphic Abstract Syntax via Grothendieck Construction

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