Mechanised Computability Theory (Q3088013)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Mechanised Computability Theory	scientific article

Statements

scholarly article

0 references

Mechanised Computability Theory (English)

0 references

Michael Norrish

0 references

Interactive Theorem Proving

0 references

publication date

17 August 2011

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-22863-6_22

0 references

The lambda calculus. Its syntax and semantics. Rev. ed.

0 references

HOL Light: An Overview

0 references

Mechanising \(\lambda\)-calculus using a classical first order theory of terms with permutations

0 references

Proof Pearl: De Bruijn Terms Really Do Work

0 references

Theorem Proving in Higher Order Logics

0 references

Metamathematics, Machines and Gödel's Proof

0 references

Mechanizing the metatheory of LF

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-22863-6_22

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3088013

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