A note on read- times branching programs
A syntax directed translation algorithm for ALGOL-like languages
An imperative language based on distributive categories II
An object-oriented Hypertext shell.
Automatic Modification of Smalltalk Methods
Automatizace programování
Book Reviews
C source code obfuscator
Obfuscation is a process that changes the code, but without any change to semantics. This process can be done on two levels. On the binary code level, where the instructions or control flow are modified, or on the source code level, where we can change only a structure of code to make it harder to read or we can make adjustments to reduce chance of successful reverse engineering.
C++ tools to construct our user-level language
The aim of this paper is to present how to make a dedicaded computed language polymorphic and multi type, in C++to solve partial differential equations with the finite element method. The driving idea is to make the language as close as possible to the mathematical notation.
C++ Tools to construct our user-level language
The aim of this paper is to present how to make a dedicaded computed language polymorphic and multi type, in C++ to solve partial differential equations with the finite element method. The driving idea is to make the language as close as possible to the mathematical notation.
Co je LOGO?
Cryptographycal protocols in the Egerfood Information System.
Definícia syntaxu a sémantiky jazyka SNOBOL I
Definition of Flat Poset and Existence Theorems for Recursive Call
This text includes the definition and basic notions of product of posets, chain-complete and flat posets, flattening operation, and the existence theorems of recursive call using the flattening operator. First part of the article, devoted to product and flat posets has a purely mathematical quality. Definition 3 allows to construct a flat poset from arbitrary non-empty set [12] in order to provide formal apparatus which eanbles to work with recursive calls within the Mizar langauge. To achieve this...
Distributed objects for parallel numerical applications
The C++// language (pronounced C++ parallel) was designed and implemented with the aim of importing reusability into parallel and concurrent programming, in the framework of a mimd model. From a reduced set of rather simple primitives, comprehensive and versatile libraries are defined. In the absence of any syntactical extension, the C++// user writes standard C++ code. The libraries are themselves extensible by the final users, making C++// an open system. Two specific techniques to improve performances...
Distributed Objects for Parallel Numerical Applications
The C++// language (pronounced C++parallel) was designed and implemented with the aim of importing reusability into parallel and concurrent programming, in the framework of a mimd model. From a reduced set of rather simple primitives, comprehensive and versatile libraries are defined. In the absence of any syntactical extension, the C++// user writes standard C++ code. The libraries are themselves extensible by the final users, making C++// an open system. Two specific techniques to improve performances...
Dynamic overloading with copy semantics in object-oriented languages: a formal account
Mainstream object-oriented languages often fail to provide complete powerful features altogether, such as, multiple inheritance, dynamic overloading and copy semantics of inheritance. In this paper we present a core object-oriented imperative language that integrates all these features in a formal framework. We define a static type system and a translation of the language into the meta-language λ_object,, in order to account for semantic issues and prove type safety of our proposal.
Extending the lambda-calculus with unbind and rebind
We extend the simply typed λ-calculus with unbind and rebind primitive constructs. That is, a value can be a fragment of open code, which in order to be used should be explicitly rebound. This mechanism nicely coexists with standard static binding. The motivation is to provide an unifying foundation for mechanisms of dynamic scoping, where the meaning of a name is determined at runtime, rebinding, such as dynamic updating of resources and exchange of mobile code, and delegation, where an alternative...
Extending the lambda-calculus with unbind and rebind
We extend the simply typed λ-calculus with unbind and rebind primitive constructs. That is, a value can be a fragment of open code, which in order to be used should be explicitly rebound. This mechanism nicely coexists with standard static binding. The motivation is to provide an unifying foundation for mechanisms of dynamic scoping, where the meaning of a name is determined at runtime, rebinding, such as dynamic updating of resources and exchange of mobile code, and delegation, where an alternative...
How to treat decision problems by different programming methodologies