Sciweavers

351 search results - page 38 / 71
» Logic Programs with Compiled Preferences
Sort
View
COMPUTER
2008
92views more  COMPUTER 2008»
13 years 8 months ago
Can Programming Be Liberated, Period?
higher, more appropriate, level of abstraction. It still entails writing programs, usually by using symbols, keywords, and operational instructions to tell the computer what we wan...
David Harel
ICFP
2003
ACM
14 years 8 months ago
Scripting the type inference process
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierst...
PLPV
2010
ACM
14 years 5 months ago
Singleton types here, singleton types there, singleton types everywhere
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
Stefan Monnier, David Haguenauer
SCCC
1998
IEEE
14 years 28 days ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
ICAI
2010
13 years 6 months ago
A Programming Environment for Bousi-Prolog
BousiProlog is a fuzzy logic programming language which is an extension of the standard Prolog language. The BousiProlog operational semantics is an adaptation of the SLD resoluti...
Pascual Julián Iranzo, Clemente Rubio-Manza...