Implementation of penalty function methods in LISP
Infinitary Simultaneous Recursion Theorem.
Jazyk SNOBOL I a jeho realizácia
La formalisation des langages de programmation
Metrics for Evaluation of Metaprogram Complexity
Modeling of distributed objects computing design pattern combinations using a formal specification language
Design patterns help us to respond to the challenges faced while developing Distributed Object Computing (DOC) applications by shifting developers' focus to high-level design concerns, rather than platform specific details. However, due to the inherent ambiguity of the existing textual and graphical descriptions of the design patterns, users are faced with difficulties in understanding when and how to use them. Since design patterns are seldom used in isolation but are usually combined to solve...
On the skeletal structure of Pascal statement
On-line computations of the ideal lattice of posets
Realization of generalized good translation algorithm on computer
Second Order Optimization Methods in Lisp
Semantics and translation of grammars and ALGOL-like languages
Sémantique du parallélisme et du choix du langage Electre
SMAL - The symbol manipulation language
Symbolic Implementation of the Hooke-Jeeves Method
Termination checking with types
The paradigm of type-based termination is explored for functional programming with recursive data types. The article introduces , a lambda-calculus with recursion, inductive types, subtyping and bounded quantification. Decorated type variables representing approximations of inductive types are used to track the size of function arguments and return values. The system is shown to be type safe and strongly normalizing. The main novelty is a bidirectional type checking algorithm whose soundness is...
Termination checking with types
The paradigm of type-based termination is explored for functional programming with recursive data types. The article introduces , a lambda-calculus with recursion, inductive types, subtyping and bounded quantification. Decorated type variables representing approximations of inductive types are used to track the size of function arguments and return values. The system is shown to be type safe and strongly normalizing. The main novelty is a bidirectional type checking algorithm whose ...
Thread algebra for noninterference
Thread algebra is a semantics for recent object-oriented programming languages [J.A. Bergstra and M.E. Loots, J. Logic Algebr. Program. 51 (2002) 125–156; J.A. Bergstra and C.A. Middelburg, Formal Aspects Comput. (2007)] such as C# and Java. This paper shows that thread algebra provides a process-algebraic framework for reasoning about and classifying various standard notions of noninterference, an important property in secure information flow. We will take the noninterference property given by...
Thread algebra for noninterference
Thread algebra is a semantics for recent object-oriented programming languages [J.A. Bergstra and M.E. Loots, J. Logic Algebr. Program.51 (2002) 125–156; J.A. Bergstra and C.A. Middelburg, Formal Aspects Comput. (2007)] such as C# and Java. This paper shows that thread algebra provides a process-algebraic framework for reasoning about and classifying various standard notions of noninterference, an important property in secure information flow. We will take the noninterference property given...
Toward a semantics for the QUEST language
Une réponse négative à la conjecture de E. Tronci pour les systèmes numériques typés