Sciweavers

4370 search results - page 68 / 874
» Algebra of Logic Programming
Sort
View
39
Voted
CORR
2010
Springer
46views Education» more  CORR 2010»
15 years 22 days ago
Realizability algebras: a program to well order R
Jean-Louis Krivine
65
Voted
BMCBI
2005
74views more  BMCBI 2005»
15 years 16 days ago
Versatile and declarative dynamic programming using pair algebras
Peter Steffen, Robert Giegerich
88
Voted
ICTAC
2010
Springer
14 years 10 months ago
Invariants and Well-Foundedness in Program Algebra
Ian J. Hayes
75
Voted
FSS
2006
85views more  FSS 2006»
15 years 20 days ago
The logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...