Sciweavers

640 search results - page 53 / 128
» Logical types for untyped languages
Sort
View
PPDP
2005
Springer
14 years 2 months ago
Automatic type inference via partial evaluation
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
Aaron Tomb, Cormac Flanagan
HASKELL
2006
ACM
14 years 3 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
AGILE
2008
Springer
120views GIS» more  AGILE 2008»
14 years 3 months ago
A Study on the Cognitive Plausibility of SIM-DL Similarity Rankings for Geographic Feature Types
The SIM-DL theory has been developed to enable similarity measurement between concept specifications using description logics. It thus closes the gap between similarity theories f...
Krzysztof Janowicz, Carsten Keßler, Ilija Pa...
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 10 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
ICFP
2003
ACM
14 years 9 months ago
A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
We report on work in progress devoted to the formalization of an Ordered Logical Framework (OLF) based on a two-level architecture [8] in the Hybrid system. OLF here is a second-or...
Alberto Momigliano, Jeff Polakow