Sciweavers

1989 search results - page 176 / 398
» Set functions for functional logic programming
Sort
View
174
Voted
CI
2000
114views more  CI 2000»
15 years 3 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
124
Voted
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 7 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 3 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
114
Voted
FOAL
2007
ACM
15 years 7 months ago
On the relation of aspects and monads
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
Christian Hofer, Klaus Ostermann
122
Voted
FSS
2002
125views more  FSS 2002»
15 years 3 months ago
An "orderwise" polynomial regression procedure for fuzzy data
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...
Pierpaolo D'Urso, Tommaso Gastaldi