| 2008 |
|---|
| 22 | EE | Mariangiola Dezani-Ciancaglini,
Roberto Di Cosmo,
Elio Giovannetti,
Makoto Tatsuta:
On Isomorphisms of Intersection Types.
CSL 2008: 461-477 |
| 21 | EE | Koji Nakazawa,
Makoto Tatsuta,
Yukiyoshi Kameyama,
Hiroshi Nakano:
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence.
CSL 2008: 478-492 |
| 20 | EE | Makoto Tatsuta:
Types for Hereditary Head Normalizing Terms.
FLOPS 2008: 195-209 |
| 19 | EE | Makoto Tatsuta:
Types for Hereditary Permutators.
LICS 2008: 83-92 |
| 18 | EE | Koji Nakazawa,
Makoto Tatsuta:
Strong normalization of classical natural deduction with disjunctions.
Ann. Pure Appl. Logic 153(1-3): 21-37 (2008) |
| 2007 |
|---|
| 17 | EE | Stefano Berardi,
Makoto Tatsuta:
Positive Arithmetic Without Exchange Is a Subclassical Logic.
APLAS 2007: 271-285 |
| 16 | EE | Makoto Tatsuta:
The Maximum Length of Mu-Reduction in Lambda Mu-Calculus.
RTA 2007: 359-373 |
| 15 | EE | Makoto Tatsuta:
Simple Saturated Sets for Disjunction and Second-Order Existential Quantification.
TLCA 2007: 366-380 |
| 14 | EE | Mariangiola Dezani-Ciancaglini,
Makoto Tatsuta:
A Behavioural Model for Klop's Calculus.
Electr. Notes Theor. Comput. Sci. 169: 19-32 (2007) |
| 2006 |
|---|
| 13 | EE | Makoto Tatsuta,
Mariangiola Dezani-Ciancaglini:
Normalisation is Insensible to lambda-Term Identity or Difference.
LICS 2006: 327-338 |
| 2005 |
|---|
| 12 | EE | Makoto Tatsuta,
Grigori Mints:
A simple proof of second-order strong normalization with permutative conversions.
Ann. Pure Appl. Logic 136(1-2): 134-155 (2005) |
| 2003 |
|---|
| 11 | | Koji Nakazawa,
Makoto Tatsuta:
Strong normalization proof with CPS-translation for second order classical natural deduction.
J. Symb. Log. 68(3): 851-859 (2003) |
| 1998 |
|---|
| 10 | | Makoto Tatsuta:
Realizability for Constructive Theory of Functions and Classes and its Application to Program Synthesis.
LICS 1998: 358-367 |
| 9 | EE | Makoto Tatsuta:
Realizability of Monotone Coinductive Definitions and Its Application to Program Synthesis.
MPC 1998: 338-364 |
| 1997 |
|---|
| 8 | EE | Mitsuru Tada,
Makoto Tatsuta:
The function ëa/mû\lfloor a/m\rfloor in sharply bounded arithmetic.
Arch. Math. Log. 37(1): 51-57 (1997) |
| 1994 |
|---|
| 7 | | Makoto Tatsuta:
Two Realizability Interpretations of Monotone Inductive Definitions.
Int. J. Found. Comput. Sci. 5(1): 1-21 (1994) |
| 6 | | Makoto Tatsuta:
Realizability Interpretation of Coinductive Definitions and Program Synthesis with Streams.
Theor. Comput. Sci. 122(1&2): 119-136 (1994) |
| 5 | | Satoshi Kobayashi,
Makoto Tatsuta:
Realizability Interpretation of Generalized Inductive Definitions.
Theor. Comput. Sci. 131(1): 121-138 (1994) |
| 1993 |
|---|
| 4 | | Makoto Tatsuta:
Uniqueness of Normal Proofs of Minimal Formulas.
J. Symb. Log. 58(3): 789-799 (1993) |
| 1992 |
|---|
| 3 | | Makoto Tatsuta:
Realizability Interpretation of Coinductive Definitions and Program Synthesis with Streams.
FGCS 1992: 666-673 |
| 1991 |
|---|
| 2 | | Makoto Tatsuta:
Monotone Recursive Definition of Predicates and Its Realizability Interpretation.
TACS 1991: 38-52 |
| 1 | | Makoto Tatsuta:
Program Synthesis Using Realizability.
Theor. Comput. Sci. 90(2): 309-353 (1991) |
