Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Natural Deduction for Intuitionistic Non-Commutative Linear.. - Polakow, Pfenning (1999) (18 citations) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006) Self-citation (Scedrov) (Correct)
No context found.
Miller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic 51 (1991), pp. 125--157. 33
Natural Deduction for Intuitionistic Non-Commutative Linear.. - Polakow, Pfenning (1999) (18 citations) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Intersection Types for a Logical Framework - Frank Pfenning School Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Relating Natural Deduction and Sequent Calculus for.. - Polakow, Pfenning (1999) (10 citations) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Ordered Linear Logic Programming - Jeff Polakow And Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
A Linear Spine Calculus - Cervesato, Pfenning (2001) (1 citation) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
A Linear Spine Calculus - Iliano Cervesato Advanced Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Structural Cut Elimination in Linear Logic Frank Pfenning.. - Cmu-Cs- School Of Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
A Linear Spine Calculus - Iliano Cervesato Advanced (2003) (1 citation) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Efficient Resource Management for Linear Logic Proof Search - Cervesato, Hodas, Pfenning (1997) (18 citations) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Structural Cut Elimination in Linear Logic - Pfenning (1994) (7 citations) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Electronic Notes in Computer Science 1 (1995) - On Modal Calculus (1995) (4 citations) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
A Declarative Alternative to - Assert In Logic Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Journal of Pure and Applied Logic, 1989.
A Linear Spine Calculus - Iliano Cervesato And (2003) (1 citation) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Refinement Types for Logical Frameworks - Frank Pfenning Department (1993) (27 citations) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-- 157, 1991. 13
Monadic Concurrent Linear Logic Programming - Lopez, Pfenning, Polakow, Watkins (2005) Self-citation (Pfenning) (Correct)
No context found.
D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Ordered Linear Logic Programming - Polakow, Pfenning (1998) (2 citations) Self-citation (Pfenning) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Unknown - Resolution In The Self-citation (Miller) (Correct)
No context found.
D. Miller, G. Nadathur, F. Pfenning and A. Scedrov. Uniform proofs as a foundation for logic programming.Annals of Pure and Applied Logic. 51:125-157, 1991.
The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004) (3 citations) (Correct)
No context found.
D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
Modal Event Calculus in Lolli - Iliano Cervesato Luca (Correct)
No context found.
D. Miller, G. Nadathur, F. Pfenning, A. Scedrov: "Uniform proofs as a foundation for logic programming", Annals of Pure and Applied Logic 51 (1991), pp 125-157, North-Holland.
Small proof witnesses for LF - Sarkar, Pientka, Crary (2005) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991. 14
System BV without the Equalities for Unit - Kahramanogullari (2004) (5 citations) (Correct)
No context found.
Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. In Annals of Pure and Applied Logic, volume 51, pages 125--157. 1991.
Polynomial Size Deep-Inference Proofs Instead Of Exponential.. - Guglielmi (2004) (3 citations) (Correct)
No context found.
D. Miller, G. Nadathur, F. Pfenning and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic. 51:125-157, 1991.
September 2003 Invited tutorial at ICLP '03 - Atutorial On Proof (Correct)
No context found.
D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125--157, 1991.
First 50 documents Next 50
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