Sciweavers

5506 search results - page 454 / 1102
» Minimal Logic Programs
Sort
View
184
Voted
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
200
Voted
PPDP
2004
Springer
16 years 6 days ago
Semi-naive evaluation in linear tabling
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato
182
Voted
APLAS
2000
ACM
15 years 11 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin
227
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 7 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
190
Voted
LPAR
2004
Springer
16 years 6 days ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel