Sciweavers

3653 search results - page 269 / 731
» Learning of Partial Languages
Sort
View
132
Voted
ICFP
2007
ACM
16 years 5 months ago
Inductive reasoning about effectful data types
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
Andrzej Filinski, Kristian Støvring
MODELS
2009
Springer
15 years 11 months ago
Teaching Object-Oriented Modeling and UML to Various Audiences
This paper summarizes the experience of teaching objectoriented modeling and UML for more than a decade to various audiences (academic or corporate, software developers or not). W...
Sabine Moisan, Jean-Paul Rigault
HASKELL
2009
ACM
15 years 11 months ago
Lazy functional incremental parsing
Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the e...
Jean-Philippe Bernardy
123
Voted
LACL
2005
Springer
15 years 10 months ago
Learnable Classes of General Combinatory Grammars
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
Erwan Moreau
CP
2004
Springer
15 years 10 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu