Sciweavers

179 search results - page 22 / 36
» A calculus of functional BSP programs
Sort
View
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 2 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
13 years 11 months ago
Bisimulation Lattice of Chi Processes
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
Yuxi Fu
FUIN
2006
77views more  FUIN 2006»
13 years 7 months ago
The Impact of seq on Free Theorems-Based Program Transformations
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...
Patricia Johann, Janis Voigtländer
TCS
2010
13 years 5 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
IFIP
2009
Springer
14 years 2 months ago
Static Detection of Logic Flaws in Service-Oriented Applications
Application or business logic, used in the development of services, has to do with the operations that define the application functionalities and not with the platform ones. Often...
Chiara Bodei, Linda Brodo, Roberto Bruni