Boer, Frank Sipke de (1956-)
B0027091: Utrecht Univ.
| rdfs:label | "Boer, Frank Sipke de (1956-)" |
| schema:name | "Frank Sipke de Boer" |
|
schema:family |
"de Boer" |
|
schema:given |
"Frank Sipke" |
|
schema:alternate |
"Boer, Frank S. de" |
| schema:description | "B0027091: Utrecht Univ." |
|
schema:birth |
"1956" |
|
schema:same |
wd:Q77085962 |
|
<https:/ |
|
|
<http:/ |
|
|
schema:main |
<https:/ |
Inverse relations
[ .. ] → schema:author → Boer, Frank Sipke de (1956-)
A compositional model for confluent dynamic data-flow networks / F.S. de Boer, M.M. Bonsangueschema:ProductModel
A compositional proof system for asynchronously communicating processes / F.S. de Boerand M. van Hulstschema:ProductModel
A compositional proof system for dynamic proces creation / by Frank de Boerschema:ProductModel
A fully abstract model for concurrent constraint programming / F.S. de Boer, C. Palamidessischema:ProductModel
A fully abstract model for concurrent logic languages / F.S. de Boer, C. Palamidessischema:ProductModel
A process algebra of concurrent constraint programming / by F.S. de Boerschema:ProductModel
A proof rule for process-creation / F.S. de Boerschema:ProductModel
A proof system for asynchronously communicating deterministic processes / F.S. de Boer and M. van Hulstschema:ProductModel
A proof system for asynchronously communicating deterministic processes / F.S. de Boer, M. van Hulstschema:ProductModel
A proof system for process creation / Frank S. de Boer, Pierre Americaschema:ProductModel
A proof system for the language POOL / by F.S. de Boerschema:ProductModel
A proof theory for the language POOL / F.S. de Boerschema:ProductModel
An algebraic perspective of constraint logic programming / F.S. de Boer, A. De Pierro, C. Palamidessischema:ProductModel
Asynchronous communication in process algebra : (extended abstract) / F.S. de Boer, J.W. Klop, C. Palamidessischema:ProductModel
Asynchronous communication in process algebra : extended abstract / by F.S. de Boer, J.W. Klop, C. Palamidessischema:ProductModel
Compositionality in the inductive assertion method for concurrent systems / F.S. de Boerschema:ProductModel
Embedding as a tool for language comparison / F.S. de Boer, C. Palamidessischema:ProductModel
Embedding as a tool for language comparison: on the CSP hierarchy / by Frank de Boer and Catuscia Palamidessischema:ProductModel
Embedding as a tool for language comparison: on the CSP hierarchy / Frank S. de Boer and Catuscia Palamidessischema:ProductModel
Nondeterminism and infinite computations in constraint programming / F.S. de Boer, A. Di Pierro, C. Palamidessischema:ProductModel
... show all 21
[ .. ] → schema:contributor → Boer, Frank Sipke de (1956-)
A coordination language for mobile components / F. Arbab, M.M. Bonsangue, F.S. de Boerschema:ProductModel
A logical interface description language for components / F. Arbab, M.M. Bonsangue, F.S. de Boerschema:ProductModel
A paradigm for asynchronous communication and its application to concurrent constraint programming / F.S. de Boer ... [et al.]schema:ProductModel
A proof theory for a sequential version of POOL / by Pierre America, Frank S. de Boerschema:ProductModel
A proof theory for a sequential version of POOL / P.H.M. Americaschema:ProductModel
A proof theory for process creation / P.H.M. America, F.S. de Boerschema:ProductModel
A proof theory of asynchronously communicating sequential processes / F.S. de Boer ... [et al.]schema:ProductModel
Control flow versus logic: a denotational and declarative model for guarded Horn clauses / F.S. de Boer ... [et al.]schema:ProductModel
From failure to success: comparing a denotational and a declarative semantics for Horn clause logic / F.S. de Boer ... [et al.]schema:ProductModel
Liber amicorum : Jaco de Bakker / [ed.: Frank de Boer ... et al.]schema:ProductModel
Non-monotonic concurrent constraint programming / F.S. de Boer ... [et al.]schema:ProductModel
On blocks: locality and asynchronous communication (extended abstract) / F.S. de Boer ... [et al.]schema:ProductModel
Proving concurrent constraint programs correct / F.S. de Boer ... [et al.]schema:ProductModel
Proving termination of parallel programs / K.R. Apt, F.S. de Boer, E.-R. Olderogschema:ProductModel
Proving termination of parallel programs / K.R. Apt, F.S. de Boer, E.R. Olderogschema:ProductModel
Proving total correctness of recursive procedures / P. America, F.S. de Boerschema:ProductModel
Semantic models for a version of Parlog / F.S. de Boer ... [et al.]schema:ProductModel
The failure of failures in paradigm for asynchronous communication / F.S. de Boer ... [et al.]schema:ProductModel