Sciweavers

89 search results - page 4 / 18
» Abstract Syntax and Variable Binding
Sort
View
PEPM
1993
ACM
13 years 10 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 5 months ago
The algebraicity of the lambda-calculus
Abstract. We propose a new definition for abstract syntax (with binding constructions), and, accordingly, for initial semantics and algebraicity. Our definition is based on the n...
André Hirschowitz, Marco Maggesi
DASFAA
2004
IEEE
76views Database» more  DASFAA 2004»
13 years 9 months ago
XTree for Declarative XML Querying
Abstract. How to query XML documents to extract and restructure the information is an important issue in XML research. Currently, XQuery based on XPath is the most promising standa...
Zhuo Chen, Tok Wang Ling, Mengchi Liu, Gillian Dob...
SOCO
2005
Springer
13 years 11 months ago
Flexible Binding for Reusable Composition of Web Services
Abstract. In addition to publishing composite services as reusable services, compositions can also be reused by applying them to orchestrate different component services. To do so...
Cesare Pautasso, Gustavo Alonso
SE
2010
13 years 7 months ago
Projectional Language Workbenches as a Foundation for Product Line Engineering
: In this paper I explain the benefits of projectional language workbenches for product line engineering. The ability to extend programming languages with domain specific concepts,...
Markus Voelter