Makoto Tatsuta

From MaRDI portal
Person:278746

Available identifiers

zbMath Open tatsuta.makotoMaRDI QIDQ278746

List of research outcomes

PublicationDate of PublicationType
Cut elimination for propositional cyclic proof systems with fixed-point operators2023-12-20Paper
Decision Procedure for Entailment of Symbolic Heaps with Arrays2022-12-09Paper
Monotone recursive definition of predicates and its realizability interpretation2022-08-16Paper
A decidable fragment in separation logic with inductive predicates and arithmetic2022-08-12Paper
https://portal.mardi4nfdi.de/entity/Q49894102021-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49647222021-03-03Paper
https://portal.mardi4nfdi.de/entity/Q51446612021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q52275212019-08-06Paper
Completeness and expressiveness of pointer program verification by separation logic2019-05-29Paper
Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs2018-10-23Paper
Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic2017-12-10Paper
Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System2017-05-19Paper
Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic2016-12-21Paper
Completeness for recursive procedures in separation logic2016-05-02Paper
Separation Logic with Monadic Inductive Definitions and Implicit Existentials2016-01-08Paper
On isomorphisms of intersection types2015-09-17Paper
Static analysis of multi-staged programs via unstaging translation2014-04-10Paper
https://portal.mardi4nfdi.de/entity/Q28639052013-12-04Paper
Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics2013-06-28Paper
Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types2013-04-09Paper
https://portal.mardi4nfdi.de/entity/Q29157102012-09-18Paper
Internal models of system F for decompilation2012-06-25Paper
Type checking and typability in domain-free lambda calculi2012-01-04Paper
Inhabitation of polymorphic and existential types2011-08-26Paper
Internal Normalization, Compilation and Decompilation for System ${\mathcal F}_{\beta\eta}$2010-05-04Paper
Non-Commutative First-Order Sequent Calculus2009-11-12Paper
Dual Calculus with Inductive and Coinductive Types2009-06-30Paper
Simple Saturated Sets for Disjunction and Second-Order Existential Quantification2009-03-10Paper
On Isomorphisms of Intersection Types2008-11-20Paper
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence2008-11-20Paper
Positive Arithmetic Without Exchange Is a Subclassical Logic2008-05-15Paper
Strong normalization of classical natural deduction with disjunctions2008-04-24Paper
Types for Hereditary Head Normalizing Terms2008-04-11Paper
The Maximum Length of Mu-Reduction in Lambda Mu-Calculus2008-01-02Paper
A simple proof of second-order strong normalization with permutative conversions2005-09-22Paper
Strong normalization proof with CPS-translation for second order classical natural deduction2005-02-09Paper
https://portal.mardi4nfdi.de/entity/Q49361282000-01-24Paper
The function \(\lfloor a/m\rfloor\) in sharply bounded arithmetic1998-05-26Paper
https://portal.mardi4nfdi.de/entity/Q56889101997-04-21Paper
TWO REALIZABILITY INTERPRETATIONS OF MONOTONE INDUCTIVE DEFINITIONS1994-12-12Paper
Realizability interpretation of generalized inductive definitions1994-12-05Paper
Realizability interpretation of coinductive definitions and program synthesis with streams1994-11-29Paper
Uniqueness of normal proofs of minimal formulas1994-07-07Paper
Program synthesis using realizability1992-06-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Makoto Tatsuta