Sciweavers

199 search results - page 17 / 40
» Combining Strict and Soft Typing in Functional Programming
Sort
View
104
Voted
WFLP
2000
Springer
148views Algorithms» more  WFLP 2000»
15 years 4 months ago
The Use of Functional and Logic Languages in Machine Learning
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
Peter A. Flach
99
Voted
FUIN
2006
77views more  FUIN 2006»
15 years 13 days ago
The Impact of seq on Free Theorems-Based Program Transformations
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...
Patricia Johann, Janis Voigtländer
100
Voted
JFP
2008
135views more  JFP 2008»
15 years 12 days ago
Hoare type theory, polymorphism and separation
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...
81
Voted
ECOOP
2007
Springer
15 years 6 months ago
Gradual Typing for Objects
Static and dynamic type systems have well-known strengths and weaknesses. In previous work we developed a gradual type system for a functional calculus named λ? →. Gradual typin...
Jeremy G. Siek, Walid Taha
88
Voted
JUCS
2008
165views more  JUCS 2008»
15 years 11 days ago
Shortcut Fusion of Monadic Programs
: Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and mai...
Cecilia Manzino, Alberto Pardo