Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4305274

A simple proof of a theorem of Statman

Author
MAIRSON, H. G
Digital Equipment Corp., Cambridge res. lab., Cambridge MA 02139, United States
Source

Theoretical computer science. 1992, Vol 103, Num 2, pp 387-394 ; ref : 10 ref

CODEN
TCSCDI
ISSN
0304-3975
Scientific domain
Computer science
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Complétude Démonstration théorème Fonction booléenne Informatique théorique Lambda calcul Langage programmation Méthode réduction Système informatique Théorie type
Keyword (en)
Completeness Theorem proving Boolean function Computer theory Lambda calculus Programming language Reduction method Computer system
Keyword (es)
Plenitud Demostración teorema Función booliana Informática teórica Lambda cálculo Lenguaje programación Método reducción Sistema informático
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A07 Programming theory

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
4305274

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web