scientific article; zbMATH DE number 7359423

DOI10.4230/LIPIcs.FSCD.2018.27zbMath1462.68025MaRDI QIDQ4993359

Paweł Parys

Publication date: 15 June 2021

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

zbMATH Keywords

lambda-calculushigher-order recursion schemeshomogeneous typessafe schemes

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The IO- and OI-hierarchies
• The IO and OI hierarchies revisited
• Simply typed fixpoint calculus and collapsible pushdown automata
• Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
• On the Significance of the Collapse Operation
• The Complexity of the Diagonal Problem for Recursion Schemes
• Indexed Grammars—An Extension of Context-Free Grammars
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
• The Safe Lambda Calculus

This page was built for publication: