Brigitte Pientka  Home/Search
Context Related
| cmu.edu/~bp/proposal.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~bp/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Based on a logic programming interpretation, it supports executing logical systems and reasoning with and about them, thereby reducing the effort required for each particular logical system. The traditional logic programming paradigm is extended by replacing first-order terms with dependently typed -terms and allowing implication and universal quantification ... (Update)
Cited by: More
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005) (Correct)
Small proof witnesses for LF - Sarkar, Pientka, Crary (2005) (Correct)
A Modal Foundation for Meta-Variables - Aleksandar Nanevski Brigitte (2003) (Correct)
Active bibliography (related documents): More All
0.9: Higher-Order Substitution Tree Indexing - Pientka (2003) (Correct)
0.5: Lifting Temporal Proofs Through Abstractions - Namjoshi (2003) (Correct)
0.5: Model Checking and Evidence Exploration - Dong, Ramakrishnan, Smolka (2003) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: Elf: A Meta-Language for Deductive Systems (System Description) - Pfenning (Correct)
0.1: Mode and Termination Checking for Higher-Order Logic.. - Ekkehard Rohwedder.. (1996) (Correct)
0.1: A Logical Framework For Reasoning About Logical Specifications - Tiu (2004) (Correct)
Related documents from co-citation: More All
4: Optimizing higher-order pattern unification - Pientka, Pfenning - 2003
3: Higher-order substitution tree indexing - Pientka - 2003
3: A framework for defining logics - Harper, Honsell et al. - 1987
BibTeX entry: (Update)
Brigitte Pientka. Tabled higher-order logic programming. PhD thesis, Department of Computer Sciences, Carnegie Mellon University, 2003. forthcoming. http://citeseer.ist.psu.edu/pientka03tabled.html More
@misc{ pientka03tabled,
author = "B. Pientka",
title = "Tabled higher-order logic programming",
text = "Brigitte Pientka. Tabled higher-order logic programming. PhD thesis, Department
of Computer Sciences, Carnegie Mellon University, 2003. forthcoming.",
year = "2003",
url = "citeseer.ist.psu.edu/pientka03tabled.html" }
Citations (may not include all citations):434 A framework for defining logics - Harper, Honsell et al. - 1993 ACM DBLP
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991 ACM DBLP
264 Safe kernel extensions without run-time checking - Necula, Lee ACM DBLP
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1991 ACM DBLP
172 Higher-order abstract syntax (context) - Pfenning, Elliott - 1988 ACM DBLP
166 An overview of Prolog (context) - Nadathur, Miller - 1988
136 System description: Twelf --- a meta-logical framework for d.. - Pfenning, Schurmann - 1999
112 OLD resolution with tabulation (context) - Tamaki, Sato - 1986 ACM DBLP
101 HILOG: A foundation for higherorder logic programming - Chen, Kifer et al. - 1993
90 A linear logical framework - Cervesato, Pfenning - 1996 ACM DBLP
79 ACM Transactions on Programming Languages and Systems (context) - Morrisett, Walker et al.
71 Elf: A language for logic definition and verified meta-progr.. - Pfenning - 1989
68 Unification under a mixed prefix (context) - Miller - 1992 ACM DBLP
65 A semantic model of types and machine instructions for proof.. - Appel, Felty - 2000
56 Unification and anti-unification in the Calculus of Construc.. - Pfenning - 1991 DBLP
53 Implementing tactics and tacticals in a higher-order logic p.. - Felty - 1993 DBLP
42 Termination Proofs for Logic Programs (context) - Plumer - 1990 ACM
39 Natural deduction as higher-order resolution - Paulson - 1986 ACM DBLP
29 Oracle-based checking of untrusted software - Necula, Rahul - 2001 ACM DBLP
28 An abstract machine for tabled execution of fixed-order stra.. (context) - Sagonas, Swift - 1998 ACM DBLP
27 Mode and termination checking for higher-order logic program.. - Rohwedder, Pfenning - 1996 ACM DBLP
27 A resolution theorem prover for intuitionistic logic - Tammet
24 Higher-Order Rewriting with Dependent Types - Virga - 2000
22 and proof irrelevance in modal type theory (context) - Pfenning, extensionality - 2001
20 Substitution tree indexing - Graf ACM DBLP
20 Automating the meta theory of deductive systems - Schurmann - 2000 ACM
20 Efficient tabling mechanisms for logic programs - Ramakrishnan, Rao et al. - 1995
20 Logic programming with focusing proofs in linear logic (context) - Andreoli - 1992
19 Computation and Deduction - Pfenning DBLP
19 Difference matching (context) - Basin, Walsh - 1992 ACM DBLP
19 Term indexing (context) - Ramakrishnan, Sekar et al. - 2001 ACM
18 Spass: Combining superposition (context) - Weidenbach
12 Termination analysis for tabled logic programming - Decorte, De Schreye et al. ACM DBLP
11 Automated theorem proving in a simple meta-logic for LF - Schurmann, Pfenning - 1998 ACM DBLP
11 A divergence critic (context) - Walsh - 1994 ACM DBLP
11 Termination and reduction checking for higher-order logic pr.. - Pientka ACM DBLP
10 Efficient access mechanisms for tabled logic programs - Ramakrishnan, Rao et al. - 1999 DBLP
9 ACM Transactions on Programming Languages and Systems (context) - Dawson, Ramakrishnan et al. - 1995
8 Modular termination proofs for Prolog with tabling - Verbaeten, Sagonas et al. - 1998 ACM DBLP
8 Optimizing clause resolution: Beyond unification factoring - Dawson, Ramakrishnan et al. - 1995 DBLP
5 and Pilar Nivela (context) - Ganzinger, Nieuwenhuis
4 Isabelle: The next seven hundred theorem provers (context) - Paulson - 1988
4 Justifying proofs using memo tables - Roychoudhury, Ramakrishnan et al. ACM DBLP
3 Two loop detection mechanisms: a comparison - Howe - 1997
3 Speculative beats conservative justification - Guo, Ramakrishnan et al. - 2001
3 A new paradigm for mobile-code security (context) - Sekar, Ramakrishnan et al. - 2001
3 Indexing fur Terme hoherer Stufe (context) - Klein - 1997
2 Programming in tabled logic programming (context) - Warren - 1999
2 Proof-theoretic foundation of compilation in logic programmi.. - Cervesato ACM
2 Design and implementation of jump tables for fast indexing o.. (context) - Dawson, Ramakrishnan et al. - 1995
1 Spine calculus (context) - Cervesato, Pfenning
Documents on the same site (http://www.cs.cmu.edu/~bp/): More
Matrix-based Inductive Theorem Proving - Kreitz, Pientka (2000) (Correct)
Automating inductive Specification Proofs in NuPRL - Pientka, Kreitz (1998) (Correct)
A Heuristic for Case Analysis - Pientka (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC