scientific article; zbMATH DE number 7359401

DOI10.4230/LIPICS.FSCD.2018.5zbMath1462.68019MaRDI QIDQ4993331

Sabine Broda, Sandra Alves

Publication date: 15 June 2021

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

zbMATH Keywords

rewritingPSPACEtype inhabitationsimple types

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (1)

Pre-grammars and inhabitation for a subset of rank 2 intersection types

Cites Work

• Intuitionistic propositional logic is polynomial-space complete
• Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete
• Proof finding algorithms for implicational logics
• Normal proofs and their grammar
• On Long Normal Inhabitants of a Type
• The number of proofs for a BCK-formula
• Inhabitation in Intersection and Union Type Assignment Systems
• Automata Theoretic Account of Proof Search
• The Principal Type-Scheme of an Object in Combinatory Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: