Sciweavers

4438 search results - page 528 / 888
» The Case for Collaborative Programming
Sort
View
CADE
2007
Springer
16 years 7 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
16 years 7 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman
ICFP
2006
ACM
16 years 6 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
ICFP
2003
ACM
16 years 6 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz
196
Voted
ICFP
2002
ACM
16 years 6 months ago
Typing dynamic typing
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...
Arthur I. Baars, S. Doaitse Swierstra