Sciweavers

1538 search results - page 119 / 308
» Programming with Patterns
Sort
View
101
Voted
PEPM
1994
ACM
15 years 4 months ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder
81
Voted
ICFP
2006
ACM
16 years 22 days ago
Extensible programming with first-class cases
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
Matthias Blume, Umut A. Acar, Wonseok Chae
133
Voted
SIGCSE
2002
ACM
202views Education» more  SIGCSE 2002»
15 years 12 days ago
A tutorial program for propositional logic with human/computer interactive learning
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propo...
Stacy Lukins, Alan Levicki, Jennifer Burg
120
Voted
COMPSAC
2008
IEEE
15 years 7 months ago
Ontology Model-Based Static Analysis on Java Programs
1 Typical enterprise and military software systems consist of millions of lines of code with complicated dependence on library abstractions. Manually debugging these codes imposes ...
Lian Yu, Jun Zhou, Yue Yi, Ping Li, Qianxiang Wang
134
Voted
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 24 days ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...