Simply typed fixpoint calculus and collapsible pushdown automata.
- Published in:
- Mathematical Structures in Computer Science, 2016, v. 26, n. 7, p. 1304, doi. 10.1017/S0960129514000590
- By:
- Publication type:
- Article
Works matching IS 09601295 AND DT 2016 AND VI 26 AND IP 7
Results: 5
1
2
Specifying Peirce's law in classical realizability.
- Published in:
- Mathematical Structures in Computer Science, 2016, v. 26, n. 7, p. 1269, doi. 10.1017/S0960129514000450
- By:
- Publication type:
- Article
3
A coalgebraic view on decorated traces.
- Published in:
- Mathematical Structures in Computer Science, 2016, v. 26, n. 7, p. 1234, doi. 10.1017/S0960129514000449
- By:
- Publication type:
- Article
4
Formalization of real analysis: a survey of proof assistants and libraries.
- Published in:
- Mathematical Structures in Computer Science, 2016, v. 26, n. 7, p. 1196, doi. 10.1017/S0960129514000437
- By:
- Publication type:
- Article
5
On quantum lambda calculi: a foundational perspective.
- Published in:
- Mathematical Structures in Computer Science, 2016, v. 26, n. 7, p. 1107, doi. 10.1017/S0960129514000425
- By:
- Publication type:
- Article