scientific article; zbMATH DE number 7649961
From MaRDI portal
Publication:5875420
DOI10.4230/LIPICS.ITP.2019.12MaRDI QIDQ5875420
No author found.
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1810.08380
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Parametric Church's thesis: synthetic computability without choice ⋮ Certifying expressive power and algorithms of reversible primitive permutations with \textsf{Lean} ⋮ Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean} ⋮ Formalization of the computational theory of a Turing complete functional language model
This page was built for publication:
