6829 search results - page 418 / 1366 » Quantitative Generalizations of Languages |
298
Voted
POPL
2007
ACM
16 years 7 months ago
2007
ACM
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...
189
Voted
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
188
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
166
Voted
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
194
Voted
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...