Sciweavers

1017 search results - page 146 / 204
» Higher-Order Logic Programming Languages with Constraints: A...
Sort
View
POPL
2007
ACM
15 years 10 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
POPL
2012
ACM
13 years 5 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
91
Voted
ICFP
2006
ACM
15 years 9 months ago
Algebraic fusion of functions with an accumulating parameter and its improvement
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
Shin-ya Katsumata, Susumu Nishimura
93
Voted
ICLP
2007
Springer
15 years 3 months ago
DLVHEX-SPARQL: A SPARQL Compliant Query Engine Based on DLVHEX
This paper describes the dlvhex SPARQL plugin, a query processor for the upcoming Semantic Web query language standard by W3C. We report on the implementation of this languages usi...
Axel Polleres, Roman Schindlauer
86
Voted
JOT
2010
114views more  JOT 2010»
14 years 8 months ago
Semantic Annotation for Java
This paper describes how to use annotation to provide semantic information. The applications include the automatic construction of a GUI so that the user input is constrained to a...
Douglas Lyon