Sciweavers

367 search results - page 60 / 74
» Adapting functional programs to higher order logic
Sort
View
IFIP
2004
Springer
14 years 2 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
REFLECTION
2001
Springer
14 years 1 months ago
Separation of Concerns in Mobile Agent Applications
Abstract. Using mobile agent systems, cooperative distributed applications that run over the Internet can be constructed flexibly. However, there are some problems: it is difficul...
Naoyasu Ubayashi, Tetsuo Tamai
ICFP
2005
ACM
14 years 8 months ago
A computational approach to reflective meta-reasoning about languages with bindings
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...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
POPL
2007
ACM
14 years 9 months ago
Generative unbinding of names
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...
Andrew M. Pitts, Mark R. Shinwell
AOSD
2003
ACM
14 years 1 months ago
Quantifying aspects in middleware platforms
Middleware technologies such as Web Services, CORBA and DCOM have been very successful in solving distributed computing problems for a large family of application domains. As midd...
Charles Zhang, Hans-Arno Jacobsen