Sciweavers

286 search results - page 8 / 58
» Reasoning About Partial Functions in the Formal Development ...
Sort
View
CORR
2002
Springer
93views Education» more  CORR 2002»
13 years 7 months ago
Logic program specialisation through partial deduction: Control issues
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...
Michael Leuschel, Maurice Bruynooghe
AISC
2004
Springer
13 years 11 months ago
Four Approaches to Automated Reasoning with Differential Algebraic Structures
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...
Jesús Aransay, Clemens Ballarin, Julio Rubi...
ENTCS
2002
97views more  ENTCS 2002»
13 years 7 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott
KI
1990
Springer
13 years 11 months ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz
BIRTHDAY
2010
Springer
13 years 7 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka