650 search results - page 54 / 130 » Logical Bisimulations and Functional Languages |
ERLANG
2007
ACM
13 years 11 months ago
2007
ACM
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
AAECC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
IAT
2009
IEEE
13 years 11 months ago
2009
IEEE
Recently, multi-attribute negotiation has been extensively studied from a game-theoretic viewpoint. Since normal and extensive form games have the drawback of requiring an explicit...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...