37 search results - page 2 / 8 » Toward a general theory of names: binding and scope |
POPL
2007
ACM
14 years 5 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...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
ICFP
2003
ACM
14 years 5 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
HICSS
2006
IEEE
13 years 11 months ago
2006
IEEE
This study addresses a long-standing and wellrecognized problem in KM research, namely the lack of conceptual integration and a cumulative tradition. Knowledge management needs an...
POPL
2010
ACM
14 years 2 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...