Polymorphic lemmas and definitions in $\lambda$Prolog and Twelf
type: Item
instance of: scholarly article
title: Polymorphic lemmas and definitions in $\lambda$Prolog and Twelf
zbMATH Open document ID: 1085.68015
DOI: 10.1017/S1471068403001698
author: Andrew W. Appel
author: Amy P. Felty
published in: Theory and Practice of Logic Programming
publication date: 2004-09-24T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 2102945
zbMATH Keywords: theorem proving
zbMATH Keywords: higher-order logic programming
zbMATH Keywords: logical frameworks
zbMATH Keywords: polymorphism
zbMATH Keywords: proof-carrying code
zbMATH Keywords: Lambda Prolog
zbMATH Keywords: Twelf
MaRDI profile type: MaRDI publication profile
Wikidata QID: Q124841043
full work available at URL: s1471068403001698
OpenAlex ID: W1980229219
Recommended article: Encoding a dependent-type λ-calculus in a logic programming language
Recommended article: Q2763626
Recommended article: Q3491030
Recommended article: Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Recommended article: Q4249901
description: scientific article; zbMATH DE number 2102945