Sciweavers

641 search results - page 52 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
ENTCS
2010
90views more  ENTCS 2010»
13 years 8 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...
PLDI
2009
ACM
14 years 8 months ago
An integrated proof language for imperative programs
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
Karen Zee, Viktor Kuncak, Martin C. Rinard
ICFP
2009
ACM
14 years 8 months ago
Safe functional reactive programming through dependent types
Functional Reactive Programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchr...
Neil Sculthorpe, Henrik Nilsson
AC
2000
Springer
14 years 15 days ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier
ISTA
2003
13 years 9 months ago
Managing Business Logic with Symbolic Computation
: A new approach of building enterprise distributed applications for layer of business rules as standard part of architecture is proposed in this paper. The approach uses symbolic ...
Ruslan Shevchenko, Anatoly E. Doroshenko