Results 1  10
of
83,570
Transformers for Symbolic Computation and Formal Deduction
 Proceedings of the Workshop on the Role of Automated Deduction in Mathematics, CADE17
, 2000
"... . A transformer is a function that maps expressions to expressions. Many transformational operatorssuch as expression evaluators and simpliers, rewrite rules, rules of inference, and decision procedurescan be represented by transformers. Computations and deductions can be formed by applying so ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
sound transformers in sequence. This paper introduces machinery for dening sound transformers in the context of an axiomatic theory in a formal logic. The paper is intended to be a rst step in a development of an integrated framework for symbolic computation and formal deduction. 1 Introduction
A Linear Logical Framework
, 1996
"... We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science  LICS'96 (E. Clarke editor), pp. 264275, New Brunswick, NJ, July 2730 1996. mal basis for a conservative extension of the LF logical framework. ..."
Abstract

Cited by 234 (48 self)
 Add to MetaCart
We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science  LICS'96 (E. Clarke editor), pp. 264275, New Brunswick, NJ, July 2730 1996. mal basis for a conservative extension of the LF logical framework
Computational Logic
, 1992
"... COMPUTATIONAL LOGIC Maria H. Napierala, Ph.D. Oregon Graduate Institute 1992 Supervising Professor: Richard B. Kieburtz This thesis resulted from the research on relating classical and constructive proofs. It is well known that constructive type theories constitute formal systems for constructiv ..."
Abstract
 Add to MetaCart
COMPUTATIONAL LOGIC Maria H. Napierala, Ph.D. Oregon Graduate Institute 1992 Supervising Professor: Richard B. Kieburtz This thesis resulted from the research on relating classical and constructive proofs. It is well known that constructive type theories constitute formal systems
Proofs as Computations in Linear Logic
, 2000
"... The notions of uniform proof and of resolution represent the foundations of the prooftheoretic characterization of logic programming. The class of Abstract Logic Programming Languages nicely captures these concepts for a wide spectrum of logical systems. In the logic programming setting, however, t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
, the structure of the formulas, e.g. Horn clauses and hereditary Harrop formulas, plays a crucial role in discriminating between programming and theorem proving. In the paper, and in the framework of the proofs as computations interpretation of linear logic, we present an extension of hereditary Harrop formulas
Mathematical Logic and Deduction in Computer Science Education
, 2006
"... Abstract. Mathematical logic is a discipline used in sciences and humanities with different point of view. Although in tertiary level computer science education it has a solid place, it does not hold also for secondary level education. We present a heterogeneous study both theoretical based and empi ..."
Abstract
 Add to MetaCart
Abstract. Mathematical logic is a discipline used in sciences and humanities with different point of view. Although in tertiary level computer science education it has a solid place, it does not hold also for secondary level education. We present a heterogeneous study both theoretical based
Computation and Deduction
, 1997
"... Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2 Substitution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.3 Operational Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4 A First MetaTheorem: Evaluation Returns a Value . . . . . . . . ..."
Abstract
 Add to MetaCart
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 3 Formalization in a Logical Framework 37 3.1 The SimplyTyped Fragment of LF . . . . . . . . . . . . . . . . . . . 38 3.2 HigherOrder Abstract Syntax . . . . . . . . . . . . . . . . . . . . . 40 3.3 Representing MiniML Expressions . . . . . . . . . . . . . . . . . . . 45 3.4 Judgments
Proofs
"... “mcs ” — 2013/1/10 — 0:28 — page i — #1 Mathematics for Computer Science ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
“mcs ” — 2013/1/10 — 0:28 — page i — #1 Mathematics for Computer Science
Proof Strategies in Linear Logic
 JOURNAL OF AUTOMATED REASONING
, 1994
"... Linear logic, introduced by J.Y.Girard, is a refinement of classical logic providing means for controlling the allocation of "resources". It has aroused considerable interest both from proof theorists and computer scientists. In this paper we investigate methods for automated theorem prov ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
Linear logic, introduced by J.Y.Girard, is a refinement of classical logic providing means for controlling the allocation of "resources". It has aroused considerable interest both from proof theorists and computer scientists. In this paper we investigate methods for automated theorem
Automated Deduction and Formal Methods
 ComputerAided Verification, CAV ’96, Volume 1102 of SpringerVerlag Lecture Notes in Computer Science
, 1996
"... . The automated deduction and model checking communities have developed techniques that are impressively effective when applied to suitable problems. However, these problems seldom coincide exactly with those that arise in formal methods. Using small but realistic examples for illustration, I wi ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
. The automated deduction and model checking communities have developed techniques that are impressively effective when applied to suitable problems. However, these problems seldom coincide exactly with those that arise in formal methods. Using small but realistic examples for illustration, I
Results 1  10
of
83,570