Sciweavers

641 search results - page 100 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
POPL
2004
ACM
14 years 8 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
PLDI
2012
ACM
11 years 10 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
FPCA
1989
14 years 2 days ago
Theorems for Free!
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., v...
Philip Wadler
HLPPP
1991
13 years 11 months ago
Reasoning About Synchronic Groups
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
Gruia-Catalin Roman, H. Conrad Cunningham
GECCO
2009
Springer
163views Optimization» more  GECCO 2009»
14 years 2 months ago
Dealing with inheritance in OO evolutionary testing
Most of the software developed in the world follows the object-oriented (OO) paradigm. However, the existing work on evolutionary testing is mainly targeted to procedural language...
Javier Ferrer, J. Francisco Chicano, Enrique Alba