53 search results - page 8 / 11 » Semantic Interoperability via Category Theory |
79
Voted
POPL
2010
ACM
15 years 7 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
170
click to vote
POPL
2005
ACM
15 years 10 months ago
2005
ACM
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
168
click to vote
POPL
2007
ACM
15 years 10 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...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Automatically generated HTML, as produced by WYSIWYG programs, typically contains much repetitive and unnecessary markup. This paper identifies aspects of such HTML that may be al...