Sciweavers

850 search results - page 24 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
POPL
2007
ACM
14 years 7 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
TIME
2005
IEEE
14 years 29 days ago
Analysis of Timed Processes with Data Using Algebraic Transformations
The language of timed µCRL is an extension of an ACP-style process algebra-based language µCRL with time-related features. In this paper we describe this language and its equati...
Michel A. Reniers, Yaroslav S. Usenko
JLP
2008
91views more  JLP 2008»
13 years 7 months ago
Local variable scoping and Kleene algebra with tests
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We prov...
Kamal Aboul-Hosn, Dexter Kozen
ICLP
2003
Springer
14 years 18 days ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
CADE
2008
Springer
14 years 7 months ago
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Anders Schack-Nielsen, Carsten Schürmann