Sciweavers

2607 search results - page 215 / 522
» Complete Functional Synthesis
Sort
View
APAL
2008
77views more  APAL 2008»
15 years 4 months ago
More on SOP1 and SOP2
This paper continues [Sh500] and [DzSh692]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the con...
Saharon Shelah, Alexander Usvyatsov
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 4 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
JMLR
2010
91views more  JMLR 2010»
14 years 11 months ago
Convexity of Proper Composite Binary Losses
A composite loss assigns a penalty to a realvalued prediction by associating the prediction with a probability via a link function then applying a class probability estimation (CP...
Mark D. Reid, Robert C. Williamson
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...
ENTCS
2007
85views more  ENTCS 2007»
15 years 4 months ago
Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
Emanuel Kitzelmann, Ute Schmid