Sciweavers

745 search results - page 100 / 149
» The Functional Side of Logic Programming
Sort
View
130
Voted
FLOPS
2008
Springer
15 years 5 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
DIMACS
1996
15 years 5 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
PEPM
1993
ACM
15 years 8 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
PPSWR
2005
Springer
15 years 9 months ago
Semantic Web Architecture: Stack or Two Towers?
Abstract. We discuss language architecture for the Semantic Web, and in particular different proposals for extending this architecture with a rules component. We argue that an arch...
Ian Horrocks, Bijan Parsia, Peter F. Patel-Schneid...
ICFP
2005
ACM
16 years 3 months ago
A principled approach to operating system construction in Haskell
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
Thomas Hallgren, Mark P. Jones, Rebekah Leslie, An...