Sciweavers

4370 search results - page 99 / 874
» Algebra of Logic Programming
Sort
View
MPC
2000
Springer
113views Mathematics» more  MPC 2000»
14 years 1 months ago
Proving Pointer Programs in Hoare Logic
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...
Richard Bornat
DBPL
1991
Springer
98views Database» more  DBPL 1991»
14 years 1 months ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi
PPDP
2010
Springer
13 years 8 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
JLP
2006
138views more  JLP 2006»
13 years 10 months ago
Algebraic-coalgebraic specification in CoCasl
We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatype...
Till Mossakowski, Lutz Schröder, Markus Rogge...
SEMWEB
2009
Springer
14 years 2 months ago
Reasoning With Provenance, Trust and all that other Meta Knowlege in OWL
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
Simon Schenk, Renata Queiroz Dividino, Steffen Sta...