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="Okada, Mitsuhiro"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Phase semantics for light linear logic
Max I. Kanovich
,
Mitsuhiro Okada
,
Andre Scedrov
Theoretical Computer Science
294
(3), 2003, pp. 525-549
A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
Misao Nagayama
,
Mitsuhiro Okada
Theoretical Computer Science
294
(3), 2003, pp. 551-573
Iductive-data-type systems
Frédéric Blanqui
,
Jean-Pierre Jouannaud
,
Mitsuhiro Okada
Theoretical Computer Science
272
(1-2), 2002, pp. 41-68
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics
Mitsuhiro Okada
Theoretical Computer Science
281
(1-2), 2002, pp. 471-498
Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
Mitsuhiro Okada
Theoretical Computer Science
227
(1-2), 1999, pp. 333-396
Abstract data type systems
Jean-Pierre Jouannaud
,
Mitsuhiro Okada
Theoretical Computer Science
173
(2), 1997, pp. 349-391
Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewrite system
Mitsuhiro Okada
Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC'89 (Portland, Oregon, July 17-19, 1989)
, 1989, pp. 357-363