The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Makoto Tatsuta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Makoto Tatsuta
    Realizability Interpretation of Coinductive Definitions and Program Synthesis with Streams. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:666-673 [Conf]
  2. Makoto Tatsuta
    Realizability for Constructive Theory of Functions and Classes and its Application to Program Synthesis. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:358-367 [Conf]
  3. Makoto Tatsuta, Mariangiola Dezani-Ciancaglini
    Normalisation is Insensible to lambda-Term Identity or Difference. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:327-338 [Conf]
  4. Makoto Tatsuta
    Realizability of Monotone Coinductive Definitions and Its Application to Program Synthesis. [Citation Graph (0, 0)][DBLP]
    MPC, 1998, pp:338-364 [Conf]
  5. Makoto Tatsuta
    Monotone Recursive Definition of Predicates and Its Realizability Interpretation. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:38-52 [Conf]
  6. Makoto Tatsuta, Grigori Mints
    A simple proof of second-order strong normalization with permutative conversions. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:134-155 [Journal]
  7. Mariangiola Dezani-Ciancaglini, Makoto Tatsuta
    A Behavioural Model for Klop's Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:169, n:, pp:19-32 [Journal]
  8. Makoto Tatsuta
    Two Realizability Interpretations of Monotone Inductive Definitions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1994, v:5, n:1, pp:1-21 [Journal]
  9. Koji Nakazawa, Makoto Tatsuta
    Strong normalization proof with CPS-translation for second order classical natural deduction. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2003, v:68, n:3, pp:851-859 [Journal]
  10. Makoto Tatsuta
    Uniqueness of Normal Proofs of Minimal Formulas. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:3, pp:789-799 [Journal]
  11. Satoshi Kobayashi, Makoto Tatsuta
    Realizability Interpretation of Generalized Inductive Definitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:131, n:1, pp:121-138 [Journal]
  12. Makoto Tatsuta
    Program Synthesis Using Realizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:309-353 [Journal]
  13. Makoto Tatsuta
    Realizability Interpretation of Coinductive Definitions and Program Synthesis with Streams. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:122, n:1&2, pp:119-136 [Journal]
  14. Makoto Tatsuta
    The Maximum Length of Mu-Reduction in Lambda Mu-Calculus. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:359-373 [Conf]
  15. Makoto Tatsuta
    Simple Saturated Sets for Disjunction and Second-Order Existential Quantification. [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:366-380 [Conf]

  16. Positive Arithmetic Without Exchange Is a Subclassical Logic. [Citation Graph (, )][DBLP]


  17. Non-Commutative First-Order Sequent Calculus. [Citation Graph (, )][DBLP]


  18. Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. [Citation Graph (, )][DBLP]


  19. On Isomorphisms of Intersection Types. [Citation Graph (, )][DBLP]


  20. Types for Hereditary Head Normalizing Terms. [Citation Graph (, )][DBLP]


  21. Internal Normalization, Compilation and Decompilation for System Fbh. [Citation Graph (, )][DBLP]


  22. Types for Hereditary Permutators. [Citation Graph (, )][DBLP]


  23. Dual Calculus with Inductive and Coinductive Types. [Citation Graph (, )][DBLP]


  24. Completeness of Pointer Program Verification by Separation Logic. [Citation Graph (, )][DBLP]


  25. The function ëa/mû\lfloor a/m\rfloor in sharply bounded arithmetic. [Citation Graph (, )][DBLP]


  26. Strong normalization of classical natural deduction with disjunctions. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002