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
[1]
Hilfe
Suche: Author="Miller, Dale"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A formal framework for specifying sequent calculus proof systems
Dale Miller
,
Elaine Pimentel
Theoretical Computer Science
474
, 2013, pp. 98-116
Nominal abstraction
Andrew Gacek
,
Dale Miller
,
Gopalan Nadathur
Information and Computation
209
(1), 2011, pp. 48-73
Focusing and polarization in linear, intuitionistic, and classical logics
Chuck Liang
,
Dale Miller
Theoretical Computer Science
410
(46), 2009, pp. 4747-4768
Encoding transition systems in sequent calculus
Raymond McDowell
,
Dale Miller
,
Catuscia Palamidessi
Theoretical Computer Science
294
(3), 2003, pp. 411-437
Encoding generic judgments
Dale Miller
,
Alwen Tiu
Lecture Notes in Computer Science
2556
, 2002, pp. 18-32
Cut-elimination for a logic with definitions and induction
Raymond McDowell
,
Dale Miller
Theoretical Computer Science
232
(1-2), 2000, pp. 91-119
Sequent calculus and the specification of computation
Dale Miller
Technical Report, 1997
Forum: A multiple-conclusion specification logic
Dale Miller
Theoretical Computer Science
165
(1), 1996, pp. 201-232
Logic programming in a fragment of intuitionistic linear logic
Joshua S. Hodas
,
Dale Miller
Information and Computation
110
(2), 1994, May, pp. 327-365
Unification under a mixed prefix
Dale Miller
Journal Symbolic Computation
14
(4), 1992, pp. 321-358
Higher-order Horn clauses
Gopalan Nadathur
,
Dale Miller
Journal of the ACM
37
(4), 1990, October, pp. 777-814