Typing total recursive functions in Coq
type: Item
instance of: scholarly article
title: Typing total recursive functions in Coq
zbMATH Open document ID: 1484.68313
DOI: 10.1007/978-3-319-66107-0_24
author: Dominique Larchey-Wendling
publication date: 2018-01-04T00:00:00Z
Mathematics Subject Classification ID: 68V15
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 6821863
describes a project that uses: Coq
MaRDI profile type: Publication
full work available at URL: 978-3-319-66107-0 24
OpenAlex ID: W2746877179
cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
cites work: Modelling general recursion in type theory
cites work: Q3994895
cites work: Q4274979
cites work: Mechanised Computability Theory
cites work: Q4040892
cites work: Q4364399
cites work: Mechanising Turing Machines and Computability Theory in Isabelle/HOL
description: scientific article; zbMATH DE number 6821863