Sciweavers

8228 search results - page 271 / 1646
» Structural Logical Relations
Sort
View
ICLP
1992
Springer
15 years 10 months ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen
JDM
2000
82views more  JDM 2000»
15 years 6 months ago
Binary Equivalents of Ternary Relationships in Entity-Relationship Modeling: A Logical Decomposition Approach
Little work has been completed which addresses the logical composition and use of ternary relationships in entity-relationship modeling. Many modeling notations and most CASE tool...
Trevor H. Jones, Il-Yeol Song
POPL
2007
ACM
16 years 6 months ago
Modular type classes
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
Derek Dreyer, Robert Harper, Manuel M. T. Chakrava...
BIRTHDAY
2010
Springer
15 years 7 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
188
Voted
ICFP
2005
ACM
16 years 6 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell