Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=232
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Proof-search in type-theoretic languages: An introduction
Didier Galmiche
,
David J. Pym
Theoretical Computer Science
232
(1-2), 2000, pp. 5-53
Search algorithms in type theory
James L. Caldwell
,
Ian P. Gent
,
Judith Underwood
Theoretical Computer Science
232
(1-2), 2000, pp. 55-90
Cut-elimination for a logic with definitions and induction
Raymond McDowell
,
Dale Miller
Theoretical Computer Science
232
(1-2), 2000, pp. 91-119
Extended normal form theorems for logical proofs from axioms
Toshiyasu Arai
,
Grigori Mints
Theoretical Computer Science
232
(1-2), 2000, pp. 121-132
Efficient resource management for linear logic proof search
Iliano Cervesato
,
Joshua S. Hodas
,
Frank Pfenning
Theoretical Computer Science
232
(1-2), 2000, pp. 133-163
Proof finding algorithms for implicational logics
M.W. Bunder
Theoretical Computer Science
232
(1-2), 2000, pp. 165-186
The calculus of constructions as a framework for proof search with set variable instantiation
Amy Felty
Theoretical Computer Science
232
(1-2), 2000, pp. 187-229
Connection methods in linear logic and proof nets construction
D. Galmiche
Theoretical Computer Science
232
(1-2), 2000, pp. 231-272
Correspondences between classical, intuitionistic and uniform provability
Gopalan Nadathur
Theoretical Computer Science
232
(1-2), 2000, pp. 273-298
On the intuitionistic force of classical search
Eike Ritter
,
David Pym
,
Lincoln Wallen
Theoretical Computer Science
232
(1-2), 2000, pp. 299-333