Simply typed fixpoint calculus and collapsible pushdown automata
From MaRDI portal
Publication:2973243
DOI10.1017/S0960129514000590zbMATH Open1364.68132OpenAlexW2142927307MaRDI QIDQ2973243FDOQ2973243
Authors: S. Salvati, Igor Walukiewicz 
Publication date: 3 April 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129514000590
Recommendations
Cites Work
- LCF considered as a programming language
- On full abstraction for PCF: I, II and III
- The IO- and OI-hierarchies
- An automata-theoretical characterization of the OI-hierarchy
- Indexed Grammars—An Extension of Context-Free Grammars
- A call-by-name lambda-calculus machine
- Krivine machines and higher-order schemes
- A Saturation Method for Collapsible Pushdown Systems
- Recursive schemes, Krivine machines, and collapsible pushdown automata
- Using models to model-check recursive schemes
- A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes
- Applications of infinitary lambda calculus
Cited In (9)
- Title not available (Why is that?)
- The Complexity of the Diagonal Problem for Recursion Schemes
- Unfixing the fixpoint: the theories of the \(\lambda Y\)-calculus
- On the \(\lambda Y\) calculus
- Cost Automata, Safe Schemes, and Downward Closures
- Recursion Schemes and the WMSO+U Logic
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms
- Title not available (Why is that?)
- Types from Frames as Finite Automata
This page was built for publication: Simply typed fixpoint calculus and collapsible pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973243)
