Sciweavers

383 search results - page 41 / 77
» Formal Syntax and Semantics of Case Stacking Languages
Sort
View
POPL
2007
ACM
15 years 10 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
JELIA
2010
Springer
14 years 8 months ago
A Normal Form for Linear Temporal Equilibrium Logic
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
Pedro Cabalar
CN
2002
111views more  CN 2002»
14 years 9 months ago
Analysis and optimisation of event-condition-action rules on XML
XML is a now a dominant standard for storing and exchanging information. With its increasing use in areas such as data warehousing and e-commerce, there is a rapidly growing need ...
James Bailey, Alexandra Poulovassilis, Peter T. Wo...
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 9 months ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
JLP
2010
96views more  JLP 2010»
14 years 4 months ago
An overview of the K semantic framework
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of configurations, comput...
Grigore Rosu, Traian-Florin Serbanuta