217 search results - page 3 / 44 » A New Approach to Abstract Syntax with Variable Binding |
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
COORDINATION
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We propose and formalize HomeBPEL, a higher-order WSBPEL-like business process execution language where processes are firstclass values that can be stored in variables, p...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses -tree syntax to treat object ...