D. Galmiche, David J. Pym  Home/Search
Context Related
Links: DBLP | dcs.qmw.ac.uk/~pym/Cvpage/...lastTCS.ps dcs.qmw.ac.uk/~pym/Papersp...lastTCS.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: dcs.qmw.ac.uk/~pym/Cvpag...recent (more) From: dcs.qmw.ac.uk/~pym/Paper...recent (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce the main concepts and problems in the theory of proof-search in type-theoretic languages and survey some specific, connected topics. We do not claim to cover all of the theoretical and implementation issues in the study of proof-search in type-theoretic languages; rather, we present some key ideas and problems, starting from well-motivated points of departure such as a definition of a type-theoretic language or the relationship between languages and proof-objects. The strong... (Update)
Context of citations to this paper: More
.... At the predicate level, the essential structure of proofs is captured by brations, or indexed categories, with speci ed extra structure [17,25,6], q.v. Figure 2: The arrows in the base category are substitutions, i.e. maps between the sets Y and X of variables; The arrows...
Cited by: More
An Interpretation of the Second Order Sequent Calculus in the.. - Th Mar Ch (Correct)
Notes Towards a Semantics for Proof-search - Pym (Correct)
Similar documents (at the sentence level):
60.3%: Proof-search in Type-theoretic Languages: An Introduction - Galmiche, al. (2000) (Correct)
Active bibliography (related documents): More All
1.0: Labelled Deduction - Basin, D'Agostino, Gabbay, Matthews, .. (2000) (Correct)
0.8: Connection Methods in Linear Logic and Proof Nets Construction - Galmiche (1999) (Correct)
0.7: Kripke Resource Models of a Dependently-Typed, Bunched.. - Ishtiaq, Pym (1999) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: Resource Tableaux (Extended Abstract) - Galmiche, Méry, Pym (Correct)
0.2: Under consideration for publication in Math. Struct. in Comp. .. - The Semantics Of (Correct)
0.2: Logic Programming with Bunched Implications (Extended Abstract) - Pym (Correct)
Related documents from co-citation: More All
2: A relevant analysis of natural deduction - Ishtiaq, Pym - 1996
2: calculus: an algorithmic interpretation of classical natural deduction (context) - Parigot - 1992
2: the semantics of classical disjunction (context) - Pym, Ritter - 1998
BibTeX entry: (Update)
Galmiche, D. and D. Pym, Proof-search in type-theoretic languages: an introduction, Theoretical Computer Science 232 (2000) 5-53. http://citeseer.ist.psu.edu/article/galmiche00proofsearch.html More
@article{ galmiche00proofsearch,
author = "Didier Galmiche and David J. Pym",
title = "Proof-search in type-theoretic languages: an introduction",
journal = "Theoretical Computer Science",
volume = "232",
number = "1--2",
pages = "5--53",
year = "2000",
url = "citeseer.ist.psu.edu/article/galmiche00proofsearch.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard, variables et al. - 1986 ACM
982 Theoretical Computer Science (context) - Girard - 1987 ACM
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986 ACM
434 A framework for defining logics - Harper, Honsell et al. - 1993 ACM DBLP
434 A framework for defining logics - Harper, Honsell et al. - 1993
382 Lambda calculi with types - Barendregt - 1992 ACM
359 Introduction to higher order categorical logic (context) - Lambek, Scott - 1987 ACM
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
266 Information and Computation (context) - Coquand, Huet et al. - 1988 DBLP
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1994 ACM DBLP
257 Logic programming in a fragment of intuitionistic linear log.. - Hodas, Miller - 1994 ACM DBLP
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
233 The formulae-as-types notion of construction (context) - Howard - 1980
223 Linear objects: logical processes with built-in inheritance - Andreoli, Pareschi - 1991 ACM
191 LEGO Proof Development System: User's Manual (context) - Luo, Pollack - 1992
187 Hol : A proof generating system for higher-order logic (context) - Gordon - 1988
182 Logic for Problem Solving (context) - Kowalski - 1979 ACM
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994 ACM DBLP
174 A unification algorithm for typed -calculus (context) - Huet - 1975
167 Natural Deduction: A Proof-Theoretical Study (context) - Prawitz - 1965
149 A logical analysis of modules in logic programming (context) - Miller - 1989 ACM DBLP
142 Logic programming with focusing proofs in linear logic - Andreoli - 1992 DBLP
141 Constructive mathematics and computer programming (context) - Martin-Lof - 1982
134 PVS: Combining specification (context) - Owre, Rajan et al. - 1996
134 calculus: an algorithmic interpretation of classical natural.. (context) - Parigot - 1992
133 Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
129 The foundation of a generic theorem prover - Paulson - 1989
128 Logic and Computation : Interactive Proof with Cambridge LCF (context) - Paulson - 1987
113 Cambridge University Press (context) - Chellas - 1980
113 Computer Science Laboratory (context) - Owre, Shankar et al. - 1998
109 Programming in Martin-Lof's Type Theory (context) - Nordstrom, Petersson et al. - 1990
90 A linear logical framework - Cervesato, Pfenning - 1996 ACM DBLP
90 A Linear Logical Framework - Cervesato - 1996 ACM DBLP
88 Linear logic: its syntax and semantics - Girard - 1995
82 Logic for Computer Science: Foundations of Automatic Theorem.. (context) - Gallier - 1986 ACM
79 A uniform proof-theoretic investigation of linear logic prog.. - Pym, Harland - 1994 DBLP
79 Simple consequence relations - Avron - 1991 ACM DBLP
75 Productive use of failure in inductive proof - Ireland, Bundy - 1996 DBLP
75 Using typed lambda calculus to implement formal systems on a.. - Avron, Honsell et al. - 1992 ACM DBLP
73 Lectures on Linear Logic (context) - Troelstra - 1992
73 Theorem proving via general mating (context) - Andrews - 1981
69 On matrices with connections (context) - Bibel - 1981 ACM DBLP
60 Contraction-free sequent calculi for intuitionistic logic (context) - Dyckhoff - 1992 DBLP
55 A science of reasoning - Bundy - 1991 ACM DBLP
54 Phase semantics and sequent calculus for pure noncommutative.. (context) - Abrusci - 1991 ACM DBLP
52 TPS: A theorem proving system for classical type theory - Andrews, Bishop et al. - 1996
51 A relevant analysis of natural deduction - Ishtiaq, Pym - 1998
51 Allyn and Bacon (context) - Schmidt - 1986
49 ACL - a concurrent linear logic programming paradigm - Kobayashi, Yonezawa - 1993 DBLP
49 The Computer Modelling of Mathematical Reasoning (context) - Bundy - 1983 ACM
47 Untersuchungen uber das logische Schliessen (context) - Gentzen - 1934
46 Programming in Lygon: an overview - Harland, Pym et al. - 1996 DBLP
46 Oxford University Press (context) - Dummett, Intuitionism - 1977
46 Forum: A multiple-conclusion specification logic - Miller - 1996 DBLP
46 Resource-distribution via boolean constraints - Harland, Pym - 1997 ACM DBLP
45 Synthesis of ML programs in the system Coq (context) - Paulin-Mohring, Werner - 1993
45 The semantics and proof theory of the logic of bunched impli.. (context) - Pym - 1998
45 The semantics and proof theory of the logic of bunched impli.. (context) - Pym - 1998
43 Asynchronous communication model based on linear logic - Kobayashi, Yonezawa - 1994 ACM DBLP
42 Gentzen type systems and resolution rules (context) - Mints - 1988
41 Kripke-style models for typed lambda calculus - Mitchell, Moggi - 1981
41 The use of planning critics in mechanizing inductive proofs - Ireland - 1992 ACM DBLP
40 Proof nets: the parallel syntax for proof theory (context) - Girard - 1995
39 Springer Verlag (context) - Gordon, Milner et al. - 1979
38 Proof Theoretic Approach to Specification Languages - Chirimar - 1995 ACM
38 On proof normalization in linear logic - Galmiche, Perrier - 1994
37 Journal of Symbolic Logic (context) - Yetter, noncommutative et al. - 1990
36 Categorical logic - Pitts - 1992 ACM
34 Categorical Type Theory (context) - Jacobs - 1991
33 From Petri nets to Linear Logic (context) - Meseguer, Marti-Oliet - 1991
33 Type-theoretic foundations for concurrent object-oriented pr.. (context) - Kobayashi, Yonezawa - 1994
33 A Generalization of Analytic Deduction via Labelled Deductiv.. - D'Agostino, Gabbay - 1994
32 Classical proofs as programs (context) - Parigot - 1993 ACM DBLP
32 Implementing the meta-theory of deductive systems - Pfenning, Rohwedder - 1992 ACM DBLP
29 On closed categories of functors (context) - Day - 1970
29 Correctness and completeness of a categorical semantics of t.. (context) - Streicher - 1988
28 Encoding a dependent-type -calculus in a logic programming l.. (context) - Felty, Miller - 1990
27 A resolution theorem prover for intuitionistic logic - Tammet - 1996
27 Proof strategies in linear logic - Tammet - 1994
26 Proof search in first-order linear logic and other cut-free .. - Lincoln, Shankar - 1994 DBLP
26 Completeness results for linear logic on petri nets - Engberg, Winskel - 1997 ACM DBLP
26 Implementing the linear logic programming language Lygon - Winikoff, Harland - 1995 DBLP
25 On transforming intuitionistic matrix proofs into standard s.. - Schmitt, Kreitz - 1995
24 the intuitionistic force of classical search - Ritter, Pym et al. - 1996
24 Recursive programming with proofs (context) - Parigot - 1992 ACM DBLP
23 On bunched predicate logic - Pym - 1999 ACM DBLP
23 Automated Proof Search in Non-Classical Logics (context) - Wallen - 1990 ACM
23 ese de Doctorat d (context) - Huet, equations et al. - 1976
23 Connection-based proof construction in linear logic - Kreitz, Mantel et al. - 1997 ACM DBLP
22 Theorem proving in non-standard logics based on the inverse .. (context) - Voronkov - 1992 ACM DBLP
20 Foundations of proof search strategies design in linear logi.. - Galmiche, Perrier - 1994
20 On connections and higher-order logic (context) - Andrews - 1989 ACM DBLP
20 Xbarnacle: Making theorem provers more accessible - Lowe, Duncan - 1997
20 A proof-theoretic analysis of goal-directed provability - Harland - 1994 DBLP
20 Essentials of Logic Programming (context) - Hogger - 1990 ACM
20 Abstract families and the adjoint functor theorems (context) - Par'e, Schumacher - 1978
19 Loop-free construction of counter-models for intuitionistic .. - Pinto, Dyckhoff - 1995
19 Resolution calculus for the first order linear logic (context) - Mints - 1993
19 Programming with proofs : a second order type theory (context) - Parigot - 1988
19 A complete proof synthesis method for the cube of type syste.. (context) - Dowek - 1993 DBLP
16 Extensions and applications of higher-order unification (context) - Elliott - 1990 ACM
15 Proof-search in intuitionistic logic based on constraint sat.. - Voronkov - 1996 ACM DBLP
14 A procedure for automatic proof nets construction - Galmiche, Perrier - 1992
14 Linear higher-order pre-unification - Cervesato, Pfenning - 1996 ACM DBLP
14 Stochastic interaction and linear logic (context) - Lincoln, Mitchell et al. - 1995 ACM
13 Free deduction: an analysis of computations in classical log.. (context) - Parigot - 1991
13 Generalised algebraic theories and contextual categories (context) - Cartmell - 1994
13 Generating plans in linear logic I: Actions as proofs (context) - Masseron, Tollu et al. - 1993
13 A uniform approach to type theory (context) - Huet - 1990
13 An interpretation of Martin-Lof's type theory in a type fre .. (context) - Smith - 1984
12 Structured theory presentations and logic representations - Harper, Sannella et al. - 1994 DBLP
12 Encoding modal logics in logical frameworks - Avron, Honsell et al. - 1998 DBLP
10 Kripke resource models of a dependently-typed (context) - Ishtiaq, Pym
9 concurrent objects and computations in a FILL framework (context) - Boudinet, Galmiche - 1996
9 Proof-terms for classical and intuitionistic resolution - Ritter, Pym et al. - 1996 DBLP
8 Clarendon Press (context) - Tarski, Semantics - 1956
7 Animating formal proof at the surface: the Jape proof calcul.. (context) - Bornat, Sufrin DBLP
7 Logic programming with bunched implications (context) - Pym - 1998 DBLP
7 Forum as a Logic Programming Language (context) - Hodas, Polakow - 1996 DBLP
7 Porgi: a proof-or-refutation generator for intuitionistic pr.. (context) - Stoughton - 1996
7 Experiments in automating hardware verification using induct.. - Cantu, Bundy et al. - 1996 ACM DBLP
6 A note on representation and semantics in logical frameworks (context) - Pym - 1996
6 Linear logic proof games and optimization - Lincoln, Mitchell et al. - 1996
6 Some properties of linear logic proved by semantics methods - Avron - 1994
6 Proof nets construction and automated deduction in noncommut.. - Galmiche, Martin - 1998
6 Cut formulae and logic programming - Pinto - 1993
6 Representing proof transformations for program optimization - Anderson - 1994
6 Automatic program optimization through proof transformation (context) - Madden - 1992
6 Provability in intuitionistic linear logic from a new interp.. - Galmiche, Larchey-Wendling - 1998
5 Propre: A programming language with proofs (context) - Manoury, Parigot et al. - 1992
5 The use of explicit plans to guide proofs (context) - Bundy - 1988
5 The use of explicit plans to guide proofs (context) - Bundy, van Harmelen et al. - 1990
4 Intuitionistic proof transformations and their application t.. (context) - Egly, Schmitt - 1998 ACM DBLP
4 Artificial Intelligence and Scientific Method (context) - Gillies - 1997
4 Proof search and proof nets construction in linear logic - Galmiche, Martin - 1997
4 To appear: Bulletin of Symbolic Logic (context) - O'Hearn, Pym et al. - 1999
4 chapter Semantics for Substructural Logics (context) - Ono - 1993
4 Program development in constructive type theory - Galmiche - 1992 ACM DBLP
4 A relevant analysis of natural deduction (context) - Pym DBLP
3 Resolution and type theory (context) - Helmink - 1990 ACM DBLP
3 SKIL: A system for programming with proofs - Galmiche, Hermann - 1993
3 Logik und Grundlagen der Math (context) - Seely, natural et al. - 1983
3 Lecture Notes in Computer Science vol (context) - Paulson, theorem - 1994
3 Available on the web at http://www (context) - O'Hearn, categories et al.
3 Linear -calculus and categorical models revisited (context) - Benton, Bierman et al. - 1992
2 The UT Year of Programming series: Logical Foundations of Fu.. (context) - Coquand, analogy et al. - 1990
2 chapter The next 700 theorem provers (context) - Paulson, Computer - 1990
2 of Foundations of Computer Science (context) - Pym, algorithm et al. - 1992
2 Handbook of Logic in AI and Logic Progamming (context) - Nadathur, Miller et al.
2 Functorial Kripke-Beth-Joyal Models of the \Pi-calculus III:.. (context) - Pym - 1998
2 Proof-search in the meta-theory of deductive systems (context) - Rohwedder - 1994
2 Functorial Kripke-Beth-Joyal Models of the \Pi-calculus II: .. (context) - Pym - 1998
2 Tableau-based theorem proving and synthesis of -terms in the.. (context) - Bittel - 1992
2 chapter Logic Programming in the LF Logic Framework (context) - Pfenning - 1991
2 Proof systems for Intuitionistic Provability in Linear Logic (context) - Balat, Galmiche - 1998
2 A constructive type system to integrate logic and functional.. - Pinto, Dyckhoff - 1994
2 Synthesizing proofs from programs in the calculus of inducti.. (context) - Parant - 1995 ACM DBLP
2 Sequent calculi for the normal terms of the \Pi- and \Pi\Sig.. (context) - Pinto, Dyckhoff - 1998
2 Sematic foundations for embedding HOL in Nuprl (context) - Howe - 1996
2 An intuitionnistic theory of types (context) - Martin-Lof - 1973
2 The ALF proof editor and its proof engine (context) - Magnussen, Nordstrom - 1993
1 Higher-order unification with dependent function types (context) - Elliot - 1989 ACM DBLP
1 Representing unification in a logical framework - Brown, Wallen - 1995 ACM DBLP
1 Functorial Kripke-Beth-Joyal Models of the \Pi-calculus I: T.. (context) - Pym - 1998
1 chapter Proof-search in the \Pi-calculus (context) - Pym, Wallen - 1991
1 the proof theory of the \Pi-calculus (context) - Pym, note - 1995
1 Electronic Notes in Theoretical Computer Science (context) - Bierman, linear et al. - 1996
1 Bulletin of the EATCS YEAR = 1994 VOLUME = 52 PAGES = 203-22.. (context) - Coquand, Nordstrom et al. - 1994
1 A specification logic for concurrent objectoriented programm.. - Delzanno, Galmiche et al. - 1999
Documents on the same site (http://www.dcs.qmw.ac.uk/~pym/Cvpage/Paperspage/recent.html): More
On the Intuitionistic Force of Classical Search - Ritter, Pym (1996) (Correct)
On Bunched Predicate Logic - Pym (1999) (Correct)
Logic Programming with Bunched Implications (Extended Abstract) - Pym (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