A simple theory of expressions, judgments and derivations

Authors:
Masahiko Sato
Affiliations:
Graduate School of Informatics, Kyoto University
Venue:
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Year:
2004

Citing 5
Cited 1

The TH ∃ OREM ∀ project: a progress report

Symbolic computation and automated reasoning
CAL: A Computer Assisted Learning System for Computation and Logic

Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Theory of Judgments and Derivations

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

A framework for checking proofs naturally

Journal of Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give a simple proof of the decidability of α-equivalence. We use this new theory of expressions to define judgments and derivations formally, and we give concrete examples of derivation games to show a flavor of NF.