1
0
0
News
Διάλεξη του καθηγ. Makoto Tatsuta (National Institute of Informatics,...
dmci.csd.auth.gr
Διάλεξη του καθηγ. Makoto Tatsuta (National Institute of Informatics, Japan) στο Τμήμα Πληροφορικής ΑΠΘ με θέμα: “Brotherston's Conjecture: Equivalence of ...
"Constructivism and Com…bility", 2-6 Mar 2015, Kanazawa, Japan
resources.illc.uva.nl
) * Takayuki Kihara (JAIST) * Graham Leigh (Vienna University of Technology) *
Michael Rathjen (University of Leeds) * Masahiko Sato (Kyoto University) * Makoto Tatsuta (National Institute of Informatics) PROGRAM COMMITTEE *
Toshiyasu ...
CfPart: FLOPS (Functional and Logic Programming), Apr...
resources.illc.uva.nl
... and normalization - Internal Normalization, Compilation and Decompilation for Syste m F Stefano Berardi, Makoto Tatsuta - Normalization by ...
Network Profiles
LinkedIn: Makoto Tatsuta | プロフィール - LinkedIn
500,000,000人が活動するビジネスSNSです。 Makotoさんのプロフィールを表示する.
職歴. Chief. Takigawa Kogyo.co.ltd 年2月 – 現在 (2年 8ヶ月). KPMG. Senior
Staff · KPMG 年12月 – 2009年1月 (3年 2ヶ月). 学歴. 関西大学 大学院. 修士,
会計修士 ...
isabelle/proof.sty at master · seL4/isabelle · GitHub
github.com
git mirror of the Munich isabelle hg repository . Contribute to seL4/isabelle development by creating an account on GitHub.
Interests
Works by Makoto Tatsuta - PhilPapers
philpapers.org
A minimal formula is a formula which is minimal in provable formulas with respect to the substitution relation. This paper shows the following: (1) A β-normal proof ...
Koji Nakazawa & Makoto Tatsuta, Strong normalization of classical...
philpapers.org
This paper proves the strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and...
Makoto Tatsuta, Ken-Etsu Fujita, Ryu Hasegawa & Hiroshi Nakano,...
philpapers.org
This paper shows that the inhabitation problem in the lambda calculus with negation, product, polymorphic, and existential types is decidable, where the...
Makoto Tatsuta & Grigori Mints, A simple proof of second-order strong...
philpapers.org
A simple and complete proof of strong normalization for first- and second-order intuitionistic natural deduction including disjunction, first-order existence...
Education
Stanford Logic Seminarswww-logic.stanford.edu/old_site/sem-spr04.html
www-logic.stanford.edu
May 18 Makoto Tatsuta (National Institute of Informatics) Martin-Lof's type theory with permutative reductions. May 25 Michael Beeson
programme
rdp09.cic.unb.br
Explicit Framework for Interaction Nets. 14:30-15:00 Daisuke Kimura and Makoto Tatsuta. Dual Calculus with inductive and coinductive types. 15:00-15:30 Jeroen
Ketema. Comparing Böhm-Like Trees.
Books & Literature
Computer Science Logic: 22nd International Workshop, CSL 2008, 17th...
books.google.de
This book constitutes the refereed proceedings of the 22nd International Workshop on Computer Science Logic, CSL 2008, held as the 17th Annual Conference of...
Computer Science Logic: 23rd International Workshop, CSL 2009, 18th...
books.google.de
Coimbra, Portugal, September 7-11, 2009, Proceedings Erich Grädel, Reinhard
Kahle. Non-Commutative. First-Order. Sequent. Calculus. Makoto Tatsuta
National Institute of Informatics Hitotsubashi, Tokyo , Japan ...
Fifth Generation Computer Systems Google Books
books.google.de
theorem. In Section 6, we give general program extraction theorem, stream
program extraction theorem for TID,, and an example of program Realizability
Interpretation of Coinductive Definitions and Program Synthesis with Streams Makoto Tatsuta.
Mathematics of Program Construction: 4th International Conference,...
books.google.de
This book consitutes the refereed proceedings of the 4th International Conference on Mathematics of Program Construction, MPC'98, held in Marstrand, near...
Related Documents
Makoto Tatsuta -
conf.researchr.org
Name: Makoto Tatsuta. Affiliation: National Institute of Informatics. Personal website: http://research.nii.ac.jp/~tatsuta/index-e.html. Contributions ...
Completeness of Cyclic Proofs for Symbolic Heaps
arxiv.org
Title:Completeness of Cyclic Proofs for Symbolic Heaps. Authors:Makoto Tatsuta, Koji Nakazawa, Daisuke Kimura. (Submitted on 11 Apr (v1), last revised ...
CiteSeerX — S.: Non-Commutative Infinitary Peano Arithmetic
citeseerx.ist.psu.edu
This paper shows that the provability in non-commutative infinitary Peano arithmetic is equivalent to Heyting ... Makoto Tatsuta ...
Nakazawa , Tatsuta : Strong normalization proof with CPS-translation...
projecteuclid.org
Project Euclid - mathematics and statistics online
Scientific Publications
CALL FOR PAPERS Twenty-fifth Annual IEEE Symposium on LOGIC ...
lics.rwth-aachen.de
Twenty-fifth Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2010) July 11–14, ... Makoto Tatsuta, NII, Tokyo Wolfgang Thomas, RWTH Aachen
24th EACSL Annual Conference on Computer Science Logic
logic.las.tu-berlin.de
... University Nijmegen); Alex Simpson (University of Edinburgh); Sonja Smets ( University of Amsterdam); Makoto Tatsuta (National Institute of Informatics, Tokyo ) ...
Publications
Internal Normalization, Compilation and Decompilation for System...
link.springer.com
This paper defines a family of terms of System F which is a decompiler-normalizer for an image of System F by some injective interpretation in System F. We...
Type Inference for Bimorphic Recursion : Makoto Tatsuta : Free...
archive.org
This paper proposes bimorphic recursion, which is restricted polymorphic recursion such that every recursive call in the body of a function definition has...
Oalib search
www.oalib.com
Daisuke Kimura,Makoto Tatsuta Computer Science , 2013, DOI: LMCS-9(1:14) Abstract: This paper extends the dual ...
On Isomorphisms of Intersection Types | SpringerLink
link.springer.com
The study of type isomorphisms for different λ-cal… started over twenty years ago, and a very wide body of knowledge has been established, both in terms of...
Reports & Statements
KOMORI, Yuichi's Home Page
komoriyuichi.web.fc2.com
Proceedings) · … source file of the paper "Syntactical Investigations into BI
Logic and BB'I Logic(by Yuichi KOMORI, Studia Logica 53 (1994) )". You
need a style file "proof.sty"(written by Makoto TATSUTA) to compile this source
file.
Miscellaneous
Makoto Tatsuta (born August 18, 1960), Japanese educator Prabook
prabook.com
Makoto Tatsuta, Japanese mathematician, educator, computer scientist, educator .
Makoto Tatsuta
easychair.org
COMPUTER SCIENCE. PROGRAMINDEXES. Makoto Tatsuta. Organization:
National Institute of Informatics. Web page: http://research.nii.ac.jp/~tatsuta/index-
e.html. Pages in this Program. Program · Program for Friday, June 23rd ·
Disclaimer ...
Program for Friday, June 23rd: Talk View
easychair.org
PROGRAM FOR FRIDAY, JUNE 23RD: TALK VIEW. Days: previous day. all days. View: with abstracts session overview Stefano Berardi, Makoto Tatsuta. 17:30-17:
LICS 2010
lics.siglog.org
LOGIC IN COMPUTER SCIENCE (LICS 2010) 11th-14th July 2010, Edinburgh, Scotland, U.K. Program Chair: Jean-Pierre Jouannaud ... Makoto Tatsuta, NII, Tokyo
2017 IEEE International Conference on Big Data
cci.drexel.edu
This websites is used to present the content of IEEE International Conference on Big Data
Updating proof.sty (proof figure … macros)
www.seas.upenn.edu
Subject: Updating proof.sty (proof figure … macros) From: Makoto Tatsuta &-u.ac.jp - Date: Fri, 21 Mar :33:22 +0900
A Decidable Fragment in Separation Logic with Inductive Predicates...
www.springerprofessional.de
We consider the satisfiability problem for a fragment of separation logic including inductive predicates with shape and arithmetic properties. We
Non-Commutative First-Order Sequent Calculus - Semantic Scholar
www.semanticscholar.org
Non-Commutative First-Order Sequent Calculus Makoto Tatsuta National Institute of Informatics Hitotsubashi, Tokyo , Japan .jp
A Decidable Fragment in Separation Logic with Inductive Predicates...
research.tees.ac.uk
Quang Loc Le, Makoto Tatsuta, Jun Sun, Wei-Ngan Chin. SCDT Department of Computer Science & Information Systems. Research output: Contribution to ...
au:Tatsuta_M in:cs - SciRate Search
scirate.com
Daisuke Kimura, Makoto Tatsuta . Feb cs.LO cs.PL arXiv: v2 . Scited Scite! 0
Accepted papers – CMCS 2018
www.coalg.org
... and Muzamil Yahia. Monoidal computer III: A coalgebraic view of com…bility and complexity (Extended abstract); Stefano Berardi and Makoto Tatsuta.
Analysis and Verification of Pointer Programs — University of...
research.utwente.nl
Analysis and Verification of Pointer Programs. Marieke Huisman, Thomas Noll, Makoto Tatsuta. Formal Methods and Tools. Research output: Book/Report ...
Best Papers - etaps 2019
www.etaps.org
Stefano Berardi, Makoto Tatsuta Classical System of Martin-Löf's Inductive Definitions Is Not Equivalent to Cyclic Proof System. FoSSaCS [doi link] ...
CSL Computer Science Logiccsl2008.cs.unibo.it/accepted.html
csl2008.cs.unibo.it
Quantitative Languages Mariangiola Dezani, Roberto Di Cosmo, Elio Giovannetti and Makoto Tatsuta. On isomorphisms of intersection types
Coalgebraic Methods in Computer Science - LNCS
tel.archives-ouvertes.fr
Intuitionistic Podelski-Rybalchenko Theorem and Equivalence Between Inductive Definitions and Cyclic Proofs Stefano Berardi, Makoto Tatsuta,
Completeness for recursive procedures in separation logic
www.infona.pl
This paper proves the completeness of an extension of Hoare's logic and separation logic for pointer programs with mutual recursive procedures. This paper...
… for CG (SUMMARY)
listserv.linguistlist.org
Makoto Tatsuta's proof.sty. It is available at www.ctan.org (macros/…/contrib/
proof) or direct from the author's webpage at http://research.nii.ac.jp/~tatsuta/
proof-sty.html This is a nice, elegant package and a good alternative to ...
Llconnex.sty homepage
www.mscs.dal.ca
Updated !) Some documentation, in both DVI and PDF formats. (Also
updated !) The source code for the documentation. (Uses Makoto Tatsuta's proof.sty.)
Related search requests for Makoto Tatsuta
| Daisuke Kimura Koji Nakazawa Masahiko Sato |
People Forename "Makoto" (1572) Name "Tatsuta" (17) |
sorted by relevance / date