Sciweavers

1830 search results - page 116 / 366
» Functional Programs as Linked Data
Sort
View
POPL
2008
ACM
16 years 3 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani
130
Voted
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
15 years 10 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
JMLR
2008
127views more  JMLR 2008»
15 years 3 months ago
Incremental Identification of Qualitative Models of Biological Systems using Inductive Logic Programming
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...
Ashwin Srinivasan, Ross D. King
146
Voted
ICML
2002
IEEE
16 years 4 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
149
Voted
ESOP
2007
Springer
15 years 9 months ago
Cost Analysis of Java Bytecode
Abstract. Cost analysis of Java bytecode is complicated by its unstructured control flow, the use of an operand stack and its object-oriented programming features (like dynamic di...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...