Turing-Completeness Totally Free (Q2941179)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Turing-Completeness Totally Free	scientific article

Statements

scholarly article

0 references

Turing-Completeness Totally Free (English)

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

27 August 2015

0 references

full work available at URL

https://strathprints.strath.ac.uk/60166/

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Monads Need Not Be Endofunctors

0 references

0 references

Programming with algebraic effects and handlers

0 references

0 references

0 references

Types for Proofs and Programs

0 references

General Recursion via Coinductive Types

0 references

0 references

0 references

Containers, monads and induction recursion

0 references

Algebras, Coalgebras, Monads and Comonads

0 references

Codifying guarded definitions with recursive schemes

0 references

Small Induction Recursion

0 references

0 references

0 references

Notions of computation and monads

0 references

Algebraic operations and generic effects

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-19797-5_13

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2941179

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2941179&oldid=36198160"