Computation-as-deduction in Abella: work in progress - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Computation-as-deduction in Abella: work in progress

(1) , (1) , (1)
1

Abstract

The Abella theorem prover is based on a logic in which relations, and not functions, are defined by induction (and coinduction). Of course, many relations do, in fact, define functions and there is real value in separating functional computation (marked by determinism) from more general deduction (marked by nondeterminism and backtracking). Recent work on focused proof systems for the logic underlying Abella is used in this paper to motivate the design of various extensions to the Abella system. With these extensions to the system (which do not extend the logic), it is possible to fully automate functional computations within the relational setting as soon as a proof is provided that a given relation does, in fact, capture a total function. In this way, we can use Abella to compute functions even when data structures contain bindings.
Fichier principal
Vignette du fichier
paper.pdf (178.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01806154 , version 1 (01-06-2018)

Identifiers

  • HAL Id : hal-01806154 , version 1

Cite

Kaustuv Chaudhuri, Ulysse Gérard, Dale Miller. Computation-as-deduction in Abella: work in progress. 13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Jul 2018, Oxford, United Kingdom. ⟨hal-01806154⟩
342 View
84 Download

Share

Gmail Facebook Twitter LinkedIn More