Result 41 to 60 of 125 total
Mining for attribute definitions in a distributed two-layered DB system. (English)
J. Intell. Inf. Syst. 14, No. 2-3, 115-130 (2000).
41
A transition system semantics for the control-driven coordination language MANIFOLD. (English)
Theor. Comput. Sci. 240, No.1, 3-47 (2000).
42
${\cal M}^ω$ considered as a programming language. (English)
Ann. Pure Appl. Logic 99, No.1-3, 73-92 (1999).
43
CTADEL: A generator of efficient numerical codes. (English)
Leiden: Rijksuniv. Leiden, viii, 305 p. (1998).
44
Deadlock sensitive types for lambda calculus with resources. (English)
Arvind, V. (ed.) et al., Foundations of software technology and theoretical computer science. 18th conference, Chennai, India, December 17‒19, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1530, 30-41 (1998).
45
Full abstractness for a functional/concurrent language with higher-order value-passing. (Extended abstract). (English)
Nielsen, Mogens (ed.) et al., Computer science logic. 11th international workshop, CSL ’97. Annual conference of the EACSL, Aarhus, Denmark, August 23‒29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1414, 239-254 (1998).
46
Linear dynamic Kahn networks are deterministic. (English)
Theor. Comput. Sci. 195, No.1, 3-32 (1998).
47
Coinductive axiomatization of recursive type equality and subtyping. (English)
Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 33, No.4, 309-338 (1998).
48
Mechanization of real-time linear CSP with higher order logic. (English)
Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 29, No. 1-2, 135-163 (1997).
49
Nested graph transformation units. (English)
Int. J. Softw. Eng. Knowl. Eng. 7, No. 4, 479-502 (1997).
50
Nested graph transformation units. (English)
Int. J. Softw. Eng. Knowl. Eng. 7, No. 4, 479-502 (1997).
51
Towards an operational theory of media. (English)
Nicholas, Charles (ed.) et al., Principles of document processing. 3rd international workshop, PODP ’96, Palo Alto, CA, USA, September 23, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1293, 1-14 (1997).
52
Relational interpretations of recursive types in an operational setting. (English)
Abadi, Martín (ed.) et al., Theoretical aspects of computer software. 3rd international symposium, TACS ’97. Sendai, Japan, September 23‒26, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1281, 458-490 (1997).
53
Detecting hardware faults with systematic and design diversity. Experimental results. (English)
Comput. Syst. Sci. Eng. 11, No. 2, 83-92 (1996).
54
Solution and stability of a set of $p$th order linear differential equations with periodic coefficients via Chebyshev polynomials. (English)
Math. Probl. Eng. 2, No.2, 165-190 (1996).
55
Control flow semantics. (English)
MIT Press Series in the Foundations of Computing. Cambridge, MA: MIT Press. xxii, 564 p. \sterling 42.50 (1996).
56
A formal and intuitionistic proof of the completeness theorem of classical logic. (Une preuve formelle et intuitionniste du théorème de complétude de la logique classique.) (French)
Bull. Symb. Log. 2, No.4, 405-421 (1996).
57
Gödel’s program for new axioms: Why, where, how and what? (English)
Hájek, Petr (ed.), Gödel ’96. Logical foundations of mathematics, computer science and physics ‒ Kurt Gödel’s legacy. Proceedings of a conference, Brno, Czech Republic, August 1996. Berlin: Springer-Verlag. Lect. Notes Log. 6, 3-22 (1996).
58
Proof and design. Machine-assisted format proof as a basis for behavioural design tools. (English)
Broy, Manfred (ed.), Deductive program design. Proceedings of the NATO Advanced Study Institute, Marktoberdorf, Germany, July 26‒August 7, 1994. Berlin: Springer-Verlag. NATO ASI Ser., Ser. F, Comput. Syst. Sci. 152, 397-439 (1996).
59
The rate distortion region for coding in stationary systems. (English)
Appl. Math. Comput. Sci. 6, No.1, 123-136 (1996).
60
Result 41 to 60 of 125 total
Start
Contact
Print
General Help
