Sciweavers

378 search results - page 37 / 76
» Proof interpretations with truth
Sort
View
SCP
2000
135views more  SCP 2000»
13 years 8 months ago
A calculus of functional BSP programs
An extension of the -calculus called BS is introduced as a formal basis for functional languages expressing bulk synchronous parallel algorithms. A con uence result is shown. The ...
Frédéric Loulergue, Gaétan Ha...
CADE
2007
Springer
14 years 2 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
ICFP
2002
ACM
14 years 8 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
LPAR
2007
Springer
14 years 2 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
COGNITIVE
2001
Springer
14 years 1 months ago
Virtual Reality and Cognitive Processes
The relationship between our actions and their perceivable results is ruled by what we call the laws of nature. It is general understanding that our actions act upon real objects ...
Olaf Diettrich