scientific article; zbMATH DE number 7756112

DOI10.4230/lipics.types.2019.7MaRDI QIDQ6079236

Unnamed Author, Stephanie Weirich, Unnamed Author

Publication date: 27 October 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Haskelldependent typesirrelevanceeta-equivalence

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Typability and type checking in System F are equivalent and undecidable
• A syntactic approach to type soundness
• An algorithm for type-checking dependent types
• On Irrelevance and Algorithmic Equality in Predicative Type Theory
• Engineering formal metatheory
• Pure type systems with judgemental equality
• A framework for defining logics
• <scp>OutsideIn(X)</scp>Modular type inference with local assumptions
• Introduction to generalized type systems
• Syntax and Semantics of Quantitative Type Theory
• Degrees of Relatedness
• A Partial Type Checking Algorithm for Type:Type
• Ott: Effective tool support for the working semanticist
• System FC with explicit kind equality
• On equivalence and canonical forms in the LF type theory
• Erasure and Polymorphism in Pure Type Systems
• The Implicit Calculus of Constructions as a Programming Language with Dependent Types
• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: