Sciweavers

181 search results - page 25 / 37
» Planning Experiments in the DALI Logic Programming Language
Sort
View
OOPSLA
2004
Springer
14 years 1 months ago
A practical type system and language for reference immutability
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint exis that the abstract state of the object to whi...
Adrian Birka, Michael D. Ernst
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
14 years 1 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
PLANX
2007
13 years 9 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
GECCO
2005
Springer
195views Optimization» more  GECCO 2005»
14 years 1 months ago
Evolving fuzzy decision tree structure that adapts in real-time
A fuzzy logic algorithm has been developed that automatically allocates electronic attack (EA) resources distributed over different platforms in real-time. The controller must be ...
James F. Smith III
WADT
1998
Springer
13 years 12 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...