Sciweavers

3513 search results - page 355 / 703
» Super Logic Programs
Sort
View
127
Voted
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
16 years 18 days 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
144
Voted
PPDP
2004
Springer
15 years 9 months 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
120
Voted
APLAS
2000
ACM
15 years 8 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
173
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 3 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...
154
Voted
POPL
2012
ACM
13 years 11 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka