% $Id: minlog.bib,v 1.5 2008/01/25 13:30:18 logik Exp $

@string(apal="Annals of Pure and Applied Logic")
@string(jsl="The Journal of Symbolic Logic")
@string(lmumath="Ma\-the\-ma\-ti\-sches Institut der Universit{\"a}t 
                   M{\"u}nchen")
@string(nh="North--Holland, Amsterdam")
@string(sil="Studies in Logic and the Foundations of Ma\-the\-ma\-tics")
@string(sv="Springer Verlag, Berlin, Heidelberg, New York")
@string(tcs="Theoretical Computer Science") 

@InProceedings{AbelAltenkirch00,
  author =		 {Andreas Abel and Thomas Altenkirch},
  title =		 {A predicative strong normalization proof for a
                  $\lambda$-calculus with interleaving inductive
                  types},
  booktitle =	 {Types for Proofs and Programs, International
                  Workshop, TYPES '99, L\"okeberg, Sweden, June 1999},
  pages =		 {21--40},
  year =		 {2000},
  volume =		 {1956},
  series =		 {LNCS},
  publisher =	 {Springer Verlag, Berlin, Heidelberg, New York}
}

@InProceedings{AehligSchwichtenberg00,
  author = 	 {Klaus Aehlig and Helmut Schwichtenberg},
  title = 	 {A syntactical analysis of non-size-increa\-sing polynomial 
                  time computation},
  booktitle = 	 {Proceedings 15'th Symposium on Logic in
                  Computer Science (LICS 2000)},
  pages =	 {84--91},
  year =	 2000
}

@InProceedings{BarbaneraBerardi93,
  author =		 "Franco Barbanera and Stefano Berardi",
  title =		 "Extracting Constructive Content from Classical Logic
                  via Control--like Reductions",
  booktitle =	 "Typed Lambda Calculi and Applications",
  year =		 "1993",
  editor =		 "M. Bezem and J.F. Groote",
  pages =		 "45--59",
  publisher =	 "LNCS Vol. 664"
}

@MastersThesis{Benl98,
  author =		 {Holger Benl},
  title =		 {{Konstruktive Interpretation induktiver
                  Definitionen}},
  school =		 lmumath,
  year =		 {1998}
}

@InProceedings{BenlSchwichtenberg99,
  author =		 {Holger Benl and Helmut Schwichtenberg},
  title =		 {{Formal correctness proofs of functional programs:
                  Dijkstra's algorithm, a case study}},
  booktitle =	 {Computational Logic},
  editor =		 {U. Berger and H. Schwichtenberg},
  volume =		 {165},
  series =		 {Series F: Computer and Systems Sciences},
  year =		 {1999},
  publisher =	 {Springer Verlag, Berlin, Heidelberg, New York},
  organization = {Proceedings of the NATO Advanced Study Institute on
                  Computational Logic, held in Marktoberdorf, Germany,
                  July 29 -- August 10, 1997},
  pages =		 {113--126}
}


@InProceedings{Berger93a,
  author =		 "Ulrich Berger",
  title =		 "Program extraction from normalization proofs",
  editor =		 "M. Bezem and J.F. Groote",
  volume =		 "664",
  series =		 "LNCS",
  pages =		 "91--106",
  booktitle =	 "Typed Lambda Calculi and Applications",
  year =		 "1993",
  publisher =	 {Springer Verlag, Berlin, Heidelberg, New York}
}

@InProceedings{Berger95,
  author =		 "Ulrich Berger",
  title =		 "Programs from classical proofs",
  editor =		 "M. Behara and R. Fritsch and R.G. Lintz",
  pages =		 "187--200",
  booktitle =	 "Symposia Gaussiana. Proceedings of the 2nd Gauss
                  Symposium. Conference A: Mathematics and Theoretical
                  Physics. Munich, Germany, August 2-7, 1993",
  year =		 "1995",
  publisher =	 "Walter de Gruyter",
  address =		 "Berlin, New York"
}

@Misc{Berger95b,
  author =		 "Ulrich Berger",
  title =		 "A constructive interpretation of positive inductive
                  definitions",
  howpublished = "Draft",
  year =		 "1995",
  month =		 "March"
}

@Article{BergerBuchholzSchwichtenberg02,
  author =		 {Ulrich Berger and Wilfried Buchholz and Helmut
                  Schwichtenberg},
  title =		 {Refined Program Extraction from Classical Proofs},
  journal =		 {Annals of Pure and Applied Logic},
  year =		 {2002},
  volume =		 {114},
  pages =		 {3--25}
}

@Article{BergerEberlSchwichtenberg03,
  author =		 {Ulrich Berger and Matthias Eberl and Helmut
                  Schwichtenberg},
  title =		 {Term rewriting for normalization by evaluation},
  journal =		 {Information and Computation},
  year =		 {2003},
  volume =		 {183},
  pages =		 {19--42}
}


@Inproceedings{BergerSchwichtenberg91a,
Author = "Ulrich Berger and Helmut Schwichtenberg",
Title = "An inverse of the evaluation functional for 
         typed $\lambda$-calculus",
Booktitle = "Proceedings 6'th Symposium on Logic in Computer Science
             (LICS'91)",
Editor = "R. Vemuri",
Pages = "203--211",
Publisher = "IEEE Computer Society Press, Los Alamitos",
Year = 1991}

@InProceedings{BergerSchwichtenberg95b,
  author =		 "Ulrich Berger and Helmut Schwichtenberg",
  title =		 "Program Extraction from Classical Proofs",
  editor =		 "D. Leivant",
  volume =		 "960",
  series =		 "LNCS",
  pages =		 "77--97",
  booktitle =	 "Logic and Computational Complexity, International
                  Workshop LCC '94, Indianapolis, IN, USA, October
                  1994",
  year =		 "1995",
  publisher =	 {Springer Verlag, Berlin, Heidelberg, New York}
}

@Article{BergerSchwichtenbergSeisenberger01,
  author =		 {Ulrich Berger and Helmut Schwichtenberg and Monika
                  Seisenberger},
  title =		 {{The Warshall Algorithm and Dickson's Lemma: Two
                  Examples of Realistic Program Extraction}},
  journal =		 {Journal of Automated Reasoning},
  year =		 {2001},
  volume =		 {26},
  pages =		 {205--221}
}

@PhdThesis{Berghofer03,
  author = 	 {Stefan Berghofer},
  title = 	 {Proofs, Programs and Executable Specifications in Higher 
                  Order Logic},
  school = 	 {Institut f\"ur Informatik, TU M\"unchen},
  year = 	 2003
}

@Techreport{Bezem92,
  Author =		 "Veldman, Wim and Bezem, Marc",
  Title =		 "Ramsey's theorem and the pigeonhole principle in
                  intuitionistic mathematics",
  Institution =	 "University of Utrecht, Dept of Philosophy",
  Type =		 "Logic Group Preprint Series",
  Number =		 "72",
  Month =		 "January",
  Year =		 {1992}
}

@InProceedings{ConstableMurthy91,
  author =		 {Robert L. Constable and Chetan Murthy},
  title =		 {Finding Computational Content in Classical Proofs},
  booktitle =	 {Logical Frameworks},
  pages =		 {341--362},
  year =		 {1991},
  editor =		 {G. Huet and G. Plotkin},
  publisher =	 {Cambridge University Press}
}

@Inproceedings{CoquandC92,
  Author =		 "Catarina Coquand",
  Title =		 "A proof of normalization for simply typed lambda
                  calculus written in {ALF}",
  Booktitle =	 "Proceedings of the 1992 Workshop on Types for Proofs
                  and Programs, Baastad",
  Editor =		 "Bengt Nordstroem and Kent Peterson and Gordon
                  Plotkin",
  Pages =		 "80--87",
  Month =		 "June",
  Comment =		 "Normalisierung durch Auswertung genau wie in meiner
                  und Bergers LICS91--Arbeit",
  Year =		 {1992}
}

@InProceedings{CoquandPersson99,
  author =		 {Thierry Coquand and Hendrik Persson},
  title =		 {{Gr{\"o}bner Bases in Type Theory}},
  booktitle =	 {Types for Proofs and Programs},
  year =		 {1999},
  editor =		 {T. Altenkirch and W. Naraschewski and B. Reus},
  volume =		 {1657},
  series =		 {LNCS},
  publisher =	 {Springer Verlag, Berlin, Heidelberg, New York}
}

@Article{Dickson13,
  author =		 {L.E. Dickson},
  title =		 {Finiteness of the odd perfect and primitive abundant
                  numbers with $n$ distinct prime factors},
  journal =		 {Am. J. Math},
  year =		 {1913},
  volume =		 {35},
  pages =		 {413--422}
}



@Article{Dyckhoff92,
  author = 		 {R. Dyckhoff},
  title = 		 {Contraction--free sequent calculi for intuitionistic logic},
  journal = 	 {Journal of Symbolic Logic},
  year = 		 {1992},
  OPTkey = 		 {},
  volume = 	     {57},
  number = 	     {3},
  pages = 	     {795--807},
  month =    	 {September},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@Article{FelleisenFriedmanKohlbeckerDuba87,
  author =		 "Matthias Felleisen and Daniel P. Friedman and
                  E. Kohlbecker and B.F. Duba",
  title =		 "A syntactic theory of sequential control",
  journal =		 {Theoretical Computer Science},
  year =		 "1987",
  volume =		 "52",
  pages =		 "205--237"
}

@Article{FelleisenHieb92,
  author =		 {Matthias Felleisen and R. Hieb},
  title =		 {The revised report on the syntactic theory of
                  sequential control and state},
  journal =		 {Theoretical Computer Science},
  year =		 {1992},
  volume =		 {102},
  pages =		 {235--271}
}

@InProceedings{Friedman78,
  author =		 "Harvey Friedman",
  title =		 "Classically and intuitionistically provably
                  recursive functions",
  editor =		 "D.S. Scott and G.H. M{\"u}ller",
  volume =		 "669",
  series =		 "Lecture Notes in Mathematics",
  pages =		 "21--28",
  booktitle =	 "Higher Set Theory",
  year =		 "1978",
  publisher =	 {Springer Verlag, Berlin, Heidelberg, New York}
}

@Article{Gentzen34,
  author =		 "Gerhard Gentzen",
  title =		 "Untersuchungen {\"u}ber das logische
                  {S}chlie{\ss}en",
  journal =		 "Mathematische Zeit\-schrift",
  year =		 "1934",
  volume =		 "39",
  pages =		 "176--210, 405--431"
}

@InProceedings{Girard71,
  author =		 "Jean--Yves Girard",
  title =		 "Une extension de l'interpr\'etation de {G}{\"o}del
                  \`a l'analyse, et son application \`a
                  l'\'elimination des coupures dans l'analyse et la
                  th\'eorie des types",
  booktitle =	 "Proceedings of the Second Scandinavian Logic
                  Symposium",
  year =		 "1971",
  editor =		 "J.E. Fenstad",
  pages =		 "63--92",
  publisher =	 {North--Holland, Amsterdam}
}

@InProceedings{Griffin90,
  author =		 "Timothy G. Griffin",
  title =		 "A Formulae--as--Types Notion of Control",
  pages =		 "47--58",
  booktitle =	 "Conference Record of the Seventeenth Annual ACM
                  Symposium on Principles of Programming Languages",
  year =		 {1990}
}

@InProceedings{Hofmann99,
  author = 	 {Martin Hofmann},
  title = 	 {Linear Types and Non-Size-Increasing Polynomial Time 
                  Computation},
  booktitle = 	 {Proceedings 14'th Symposium on Logic in Computer 
                  Science (LICS'99)},
  pages =	 {464--473},
  year =	 1999}



@Booklet{Hudelmaier89,
  title = 		 {Bounds for Cut Elimination in Intuitionistic Propositional Logic},
  OPTkey = 		 {},
  author = 	 {J. Hudelmaier},
  OPThowpublished = {},
  address = 	 {Mathematische Fakult{\"a}t, Eberhard--Karls--Universit{\"a}t, T{\"u}bingen"},
  OPTmonth = 	 {},
  year =    	 {1989},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@Article{Huet75,
  Author =		 "G\'erard Huet",
  Title =		 "A Unification Algorithm for Typed
                  $\lambda$--Calculus",
  Journal =		 "Theoretical Computer Science",
  Volume =		 "1",
  Pages =		 "27--57",
  Year =		 {1975}
}


@Article{JoachimskiMatthes03,
  author = 	 {Felix Joachimski and Ralph Matthes},
  title = 	 {{Short proofs of normalisation for the simply-typed
                 $\lambda$-calculus, permutative conversions and  
                 G{\"o}del's $T$}},
  journal = 	 {Archive for Mathematical Logic},
  year = 	 2003,
  volume =	 42,
  pages =	 {59--87}
}

@InProceedings{Kohlenbach96a,
  author =		 {Ulrich Kohlenbach},
  title =		 {Analysing Proofs in Analysis},
  booktitle =	 {Logic: from Foundations to Applications. European
                  Logic Colloquium (Keele, 1993)},
  pages =		 {225--260},
  year =		 {1996},
  editor =		 {W. Hodges and M. Hyland and C. Steinhorn and
                  J. Truss},
  publisher =	 {Oxford University Press}
}

@Article{Krivine94,
  author =		 {Jean-Louis Krivine},
  title =		 {Classical logic, storage operators and second-order
                  lambda-calculus},
  journal =		 {Annals of Pure and Applied Logic},
  year =		 {1994},
  volume =		 {68},
  pages =		 {53--78}
}

@Article{Leivant85,
  Author =		 "Leivant, Daniel",
  Title =		 "Syntactic Translations and Provably Recursive
                  Functions",
  Journal =		 {The Journal of Symbolic Logic},
  Volume =		 {50},
  Number =		 {3},
  Pages =		 "682--688",
  Month =		 "September",
  Year =		 {1985}
}

@InProceedings{MartinLoef71,
  author =		 {Per Martin-L\"of},
  title =		 {Hauptsatz for the intuitionistic theory of iterated
                  inductive definitions},
  booktitle =	 {Proceedings of the Second Scandinavian Logic
                  Symposium},
  year =		 {1971},
  editor =		 {J.E. Fenstad},
  pages =		 {179--216},
  publisher =	 {North--Holland, Amsterdam}
}

@PhdThesis{Matthes98,
  author = 	 {Ralph Matthes},
  title = 	 {{Extensions of System $F$ by Iteration and Primitive
                  Recursion on Monotone Inductive Types}},
  school = 	 lmumath,
  year = 	 {1998}}


@Article{Miller91b,
  author =		 "Dale Miller",
  title =		 "A logic programming language with
                  lambda--abstraction, function variables and simple
                  unification",
  journal =		 "Journal of Logic and Computation",
  year =		 "1991",
  volume =		 "2",
  number =		 "4",
  pages =		 "497--536"
}

@Book{Mints00,
  author =		 {Grigori Mints},
  title =		 {A Short Introduction to Intuitionistic Logic},
  publisher =	 {Kluwer Academic/Plenum Publishers},
  year =		 {2000},
  address =		 {New York}
}

@Techreport{Murthy90,
  Author =		 "Murthy, Chetan",
  Title =		 "Extracting Constructive Content from Classical
                  Proofs",
  Institution =	 "Dep.of Comp.Science, Cornell Univ.",
  Type =		 "Technical Report",
  Number =		 "90--1151",
  Note =		 "PhD thesis",
  Address =		 "Ithaca, New York",
  Year =		 {1990}
}

@InProceedings{Nipkow91,
  author =		 "Tobias Nipkow",
  title =		 "Higher-order critical pairs",
  booktitle =	 "Proceedings of the Sixth Annual IEEE Symposium on
                  Logic in Computer Science",
  year =		 "1991",
  editor =		 "R. Vemuri",
  pages =		 "342--349",
  publisher =	 "IEEE Computer Society Press",
  address =		 "Los Alamitos"
}

@InProceedings{Parigot92,
  author =		 "Michel Parigot",
  title =		 "$\lambda\mu$--calculus: an algorithmic
                  interpretation of classical natural deduction",
  booktitle =	 "Proc. of Log. Prog. and Automatic Reasoning,
                  St. Petersburg",
  year =		 {1992},
  pages =		 "190--201",
  volume =		 {624},
  series =		 {LNCS},
  publisher =	 {Springer Verlag, Berlin, Heidelberg, New York}
}

@Article{PaulinMohringWerner93,
  author =		 {Christine Paulin--Mohring and Benjamin Werner},
  title =		 {Synthesis of {ML} programs in the system {C}oq},
  journal =		 {J. Symbolic Computation},
  year =		 {1993},
  volume =		 {11},
  pages =		 {1--34}
}



@Manual{minlogman,
  title = 		 {Minlog reference manual},
  OPTkey = 		 {},
  author = 	     {H. Schwichtenberg},
  organization = {LMU M\"unchen},
  address = 	 {Mathematisches Institut, Theresienstra\ss e 39, D-81371 M\"unchen},
  OPTedition = 	 {},
  OPTmonth = 	 {},
  year = 	     {2001},
  OPTnote = 	 {},
  OPTannote = 	 {}
}

@PhdThesis{Seisenberger03,
  author =		 {Monika Seisenberger},
  title =		 {On the Constructive Content of Proofs},
  school =		 {Ma\-the\-ma\-ti\-sches Institut der Universit{\"a}t
                  M{\"u}nchen},
  year =		 {2003}
}

@Book{Stoltenberg94,
  author =		 "Viggo Stoltenberg--Hansen and Edward Griffor and
                  Ingrid Lindstr{\"o}m",
  title =		 "Mathematical Theory of Domains",
  publisher =	 "Cambridge University Press",
  series =		 "Cambridge Tracts in Theoretical Computer Science",
  year =		 "1994"
}

@Book{TroelstraSchwichtenberg00,
  author =	 {Anne S. Troelstra and Helmut Schwichtenberg},
  title = 	 {Basic Proof Theory},
  publisher = 	 {Cambridge University Press},
  year = 	 2000,
  edition =	 {2nd}
}

@Book{TroelstravanDalen88,
  author =	 	 {Anne S. Troelstra and Dirk van Dalen},
  ALTeditor = 	 {},
  title = 		 {Constructivism in Mathematics. An Introduction},
  publisher = 	 {North--Holland, Amsterdam},
  year = 		 {1988},
  OPTkey = 		 {},
  volume =	 	 {121, 123},
  OPTnumber = 	 {},
  series =	 	 {sil},
  OPTaddress = 	 {},
  OPTedition = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}
