Masahiko Sato

32 papers A* 2B 3Misc 1Journal 12Unranked 10
YearRankTypeTitle / Venue / Authors
2012 J jnl
A Canonical Locally Named Representation of Binding.
J. Autom. Reason.
Randy Pollack, Masahiko Sato, Wilmer Ricciotti
2010 J jnl
External and internal syntax of the lambda-calculus.
J. Symb. Comput.
Masahiko Sato, Randy Pollack
2008 J jnl
A framework for checking proofs naturally.
J. Intell. Inf. Syst.
Masahiko Sato
2008 J jnl
Calculi of meta-variables.
Frontiers Comput. Sci. China
Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi
2004 — conf
A Simple Theory of Expressions, Judgments and Derivations.
ASIAN
Masahiko Sato
2003 B conf
Calculi of Meta-variables.
CSL
Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama, Atsushi Igarashi
2002 J jnl
A Simply Typed Context Calculus with First-class Environments.
J. Funct. Log. Program.
Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama
2002 J jnl
Strong normalizability of the non-deterministic catch/throw calculi.
Theor. Comput. Sci.
Yukiyoshi Kameyama, Masahiko Sato
2002 — conf
Theory of Judgments and Derivations.
Progress in Discovery Science
Masahiko Sato
2001 Misc conf
A Simply Typed Context Calculus with First-Class Environments.
FLOPS
Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyama
2001 — conf
CAL: A Computer Assisted Learning System for Computation and Logic.
EUROCAST
Masahiko Sato, Yukiyoshi Kameyama, Izumi Takeuti
2001 J jnl
Explicit Environments.
Fundam. Informaticae
Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
2000 — ed.
Advances in Computing Science - ASIAN 2000, 6th Asian Computing Science Conference, Penang, Malaysia, November 25-27, 2000, Proceedings
ASIAN
Jifeng He, Masahiko Sato
1999 — conf
Explicit Environments.
TLCA
Masahiko Sato, Takafumi Sakurai, Rod M. Burstall
1998 — conf
A Classical Catch/Throw Calculus with Tag Abstractions and its Strong Normalizability.
CATS
Yukiyoshi Kameyama, Masahiko Sato
1998 — ed.
Third Fuji International Symposium on Functional and Logic Programming, FLOPS 1998, Kyoto, Japan, Apil 2-4, 1998.
FLOPS
Masahiko Sato, Yoshihito Toyama
1997 B conf
Classical Brouwer-Heyting-Kolmogorov Interpretation.
ALT
Masahiko Sato
1997 J jnl
Intuitionistic and Classical Natural Deduction Systems with the Catch and the Throw Rules.
Theor. Comput. Sci.
Masahiko Sato
1996 — conf
Fault Detection Algorithm of Acoustic Inspection System for Underground Telecommunication Conduit.
ISSPA
Tetsuya Manabe, Masahiko Sato, Tadashi Kotani, Takenori Morimitsu
1994 — conf
A Purely Functional Language with Encapsulated Assignment.
TACS
Masahiko Sato
1994 — conf
Conservativeness of Lambda over lambda-sigma-Calculus.
Logic, Language and Computation
Masahiko Sato, Yukiyoshi Kameyama
1994 — ed.
Logic, Language and Computation, Festschrift in Honor of Satoru Takasu
Logic, Language and Computation
Neil D. Jones, Masami Hagiya, Masahiko Sato
1991 — conf
Adding Proof Objects and Inductive Definition Mechanisms to Frege Structures.
TACS
Masahiko Sato
1987 B conf
Quty: A Concurrent Language Based on Logic and Function.
ICLP
Masahiko Sato
1986 — ch.
QUTE: A Functional Language Based on Unification.
Logic Programming: Functions, Relations, and Equations
Masahiko Sato, Takafumi Sakurai
1984 — conf
QUTE: A Functional Language Based on Unification.
FGCS
Masahiko Sato, Takafumi Sakurai
1983 A* conf
Qute: A Prolog/Lisp Type Language for Logic Programming.
IJCAI
Masahiko Sato, Takafumi Sakurai
1983 J jnl
Theory of Symbolic Expressions, I.
Theor. Comput. Sci.
Masahiko Sato
1980 J jnl
A Cut-Free Gentzen-Type System for the Modal Logic S5.
J. Symb. Log.
Masahiko Sato
1979 A* conf
Towards a Mathematical Theory of Program Synthesis.
IJCAI
Masahiko Sato
1977 J jnl
The Retracts in
Theor. Comput. Sci.
Chiharu Hosono, Masahiko Sato
1976 J jnl
On Formal Fractions Associated with the Symmetric Groups.
J. Comb. Theory A
Masahiko Sato