Turing-Completeness Totally Free
From MaRDI portal
Publication:2941179
DOI10.1007/978-3-319-19797-5_13zbMath1432.68065OpenAlexW840746988MaRDI QIDQ2941179
Publication date: 27 August 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/60166/
Related Items (3)
A sound strategy to compile general recursion into finite depth pattern matching ⋮ Doo bee doo bee doo ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Programming with algebraic effects and handlers
- Notions of computation and monads
- Algebraic operations and generic effects
- Copatterns
- Monads Need Not Be Endofunctors
- Algebras, Coalgebras, Monads and Comonads
- Small Induction Recursion
- General Recursion via Coinductive Types
- Types for Proofs and Programs
- Containers, monads and induction recursion
- Codifying guarded definitions with recursive schemes
This page was built for publication: Turing-Completeness Totally Free