Machine Deduction
نویسنده
چکیده
We present in this paper a new type system which allows to extract code for an abstract machine instead of lambda-terms. Thus, we get a framework to compile correctly programs extracted from proof by translating their proof in our system and then extracting the code. Moreover, we will see that we can associate programs to classical proofs.
منابع مشابه
Building Intelligent Learning Database Systems
tions in data-mining applications. Induction extracts knowledge in the form of, say, rules or decision trees from existing data, and deduction applies induction results to interpret new data. An intelligent learning database (ILDB) system integrates machine-learning techniques with database and knowledge base technology. It starts with existing database technology and performs both induction an...
متن کاملAn Abstract Machine for Classes of Communicating Agents Based on Deduction
We consider the problem of defining executable runs for classes of communicating agents. We first define an abstract machine that generates runs for individual agents with non-deterministic plans. We then introduce agent classes whose communication primitives are based on deduction. Contrary to other more theoretical work, their operational semantics are given by an abstract machine that is def...
متن کاملSystem Description: TRAMP - Transformation of Machine-Found Proofs into Natural Deduction Proofs at the Assertion Level
متن کامل
A Kernel of Data Structures and Algorithms for Automated Deduction withEqualityClauses
We present Dedam (Deduction Abstact Machine), a standard architecture around which high-performance theorem provers for clausal logic with equality can be built. It includes a WAM-like heap structure for storing terms as DAG's, several indexing data structures, and mechanisms for eecient memory management and demodulation. These data structures turn out to be surprisingly well combinable due to...
متن کاملA verified abstract machine for functional coroutines
Functional coroutines are a restricted form of control mechanism, where each coroutine is represented with both a continuation and an environment. This restriction was originally obtained by considering a constructive version of Parigot’s classical natural deduction which is sound and complete for the Constant Domain logic. In this article, we present a refinement of de Groote’s abstract machin...
متن کامل