Masahiko Sato

Affiliations:
  • Kyoto University, Japan


According to our database1, Masahiko Sato authored at least 26 papers between 1976 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
A Canonical Locally Named Representation of Binding.
J. Autom. Reason., 2012

2010
External and internal syntax of the lambda-calculus.
J. Symb. Comput., 2010

2008
A framework for checking proofs naturally.
J. Intell. Inf. Syst., 2008

Calculi of meta-variables.
Frontiers Comput. Sci. China, 2008

2004
A Simple Theory of Expressions, Judgments and Derivations.
Proceedings of the Advances in Computer Science, 2004

2002
Strong normalizability of the non-deterministic catch/throw calculi.
Theor. Comput. Sci., 2002

A Simply Typed Context Calculus with First-class Environments.
J. Funct. Log. Program., 2002

Theory of Judgments and Derivations.
Proceedings of the Progress in Discovery Science, 2002

2001
Explicit Environments.
Fundam. Informaticae, 2001

CAL: A Computer Assisted Learning System for Computation and Logic.
Proceedings of the Computer Aided Systems Theory, 2001

1998
A Classical Catch/Throw Calculus with Tag Abstractions and its Strong Normalizability.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
Intuitionistic and Classical Natural Deduction Systems with the Catch and the Throw Rules.
Theor. Comput. Sci., 1997

Classical Brouwer-Heyting-Kolmogorov Interpretation.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
Fault Detection Algorithm of Acoustic Inspection System for Underground Telecommunication Conduit.
Proceedings of the Fourth International Symposium on Signal Processing and Its Applications, 1996

1994
A Purely Functional Language with Encapsulated Assignment.
Proceedings of the Theoretical Aspects of Computer Software, 1994

Conservativeness of Lambda over lambda-sigma-Calculus.
Proceedings of the Logic, 1994

1991
Adding Proof Objects and Inductive Definition Mechanisms to Frege Structures.
Proceedings of the Theoretical Aspects of Computer Software, 1991

1987
Quty: A Concurrent Language Based on Logic and Function.
Proceedings of the Logic Programming, 1987

1986
QUTE: A Functional Language Based on Unification.
Proceedings of the Logic Programming: Functions, Relations, and Equations, 1986

1984
QUTE: A Functional Language Based on Unification.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1984

1983
Theory of Symbolic Expressions, I.
Theor. Comput. Sci., 1983

Qute: A Prolog/Lisp Type Language for Logic Programming.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983

1980
A Cut-Free Gentzen-Type System for the Modal Logic S5.
J. Symb. Log., 1980

1979
Towards a Mathematical Theory of Program Synthesis.
Proceedings of the Sixth International Joint Conference on Artificial Intelligence, 1979

1977
The Retracts in <i>P omega</i> do not Form a Continuous Lattice - A Solution to Scott's Problem.
Theor. Comput. Sci., 1977

1976
On Formal Fractions Associated with the Symmetric Groups.
J. Comb. Theory, Ser. A, 1976


  Loading...