Results 1 
9 of
9
CodeGeneration OntheFly: A Key to Portable Software
, 1994
"... A technique for representing programs abstractly and independently of the eventual target architecture is presented that yields a file representation twice as compact as machine code for a CISC processor. It forms the basis of an implementation, in which the process of code generation is deferred ..."
Abstract

Cited by 49 (19 self)
 Add to MetaCart
A technique for representing programs abstractly and independently of the eventual target architecture is presented that yields a file representation twice as compact as machine code for a CISC processor. It forms the basis of an implementation, in which the process of code generation is deferred until the time of loading. At that point, native code is created on_the_fly by a code_generating loader. The process of loading with dynamic code_generation is so fast that it requires little more time than the input of equivalent native code from a disk storage medium. This is predominantly due to the compactness of the abstract program representation, which allows to counterbalance the ad...
Total Functional Programming
 Journal of Universal Computer Science
, 2004
"... We now define the notion, already discussed, of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers (or of a lambdadefinable function of positive integers). The phrase in parentheses refers to the apparatus which Chur ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
We now define the notion, already discussed, of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers (or of a lambdadefinable function of positive integers). The phrase in parentheses refers to the apparatus which Church had developed to investigate this and other problems in the foundations of mathematics: the calculus of lambda conversion. Both the Thesis and the lambda calculus have been of seminal influence on the development of Computing Science. The main subject of this article is the lambda calculus but I will begin with a brief sketch of the emergence of the Thesis. The epistemological status of Church’s Thesis is not immediately clear from the above quotation and remains a matter of debate, as is explored in other papers of this volume. My own view, which I will state but not elaborate here, is that the thesis is empirical because it relies for its significance on a claim about what can be calculated by mechanisms. This becomes clearer in
FMC: An Approach towards ArchitectureCentric System Development
 IEEE Symposium and Workshop on Engineering of Computer Based Systems
, 2003
"... The architectural level plays a major role in the engineering of computer based systems. Having proper means for representing the architecture of a system is a crucial element of large system development efforts as it reduces the amount of uncertainty among the involved stakeholders. ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The architectural level plays a major role in the engineering of computer based systems. Having proper means for representing the architecture of a system is a crucial element of large system development efforts as it reduces the amount of uncertainty among the involved stakeholders.
A direct construction of a universal extended H system
 MCU
, 2001
"... We describe a direct construction of a universal extended H system. The system receives as input the coding of an extended H system with double splicing and simulates it. It is the first time that a direct construction is described: universal results obtained until now were based on the simulation o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We describe a direct construction of a universal extended H system. The system receives as input the coding of an extended H system with double splicing and simulates it. It is the first time that a direct construction is described: universal results obtained until now were based on the simulation of universal type0 grammars or Turing machines.
Investigation of the Possibilities for Interdisciplinary Cooperation by the Use of Knowledgebased System
"... Abstract: Each problem always originates from constraints. The decision is a response to the challenges by the environment. In order to chose appropriate decision support techniques the structural complexity of the problem has to be determined. The aim of the application of knowledge based systems i ..."
Abstract
 Add to MetaCart
Abstract: Each problem always originates from constraints. The decision is a response to the challenges by the environment. In order to chose appropriate decision support techniques the structural complexity of the problem has to be determined. The aim of the application of knowledge based systems is to obtain decision support. In this paper the application of the system ‘Doctus ’ is illustrated and exemplified in connection with processing the problem of the potential cooperation between the industrial companies and institutes of higher education. The analysis was carried out by the application of inductive and deductive inference procedures taking into account the requirements of the companies and the abilities and skills of the higher educational institutions. The assessment of the results obtained may generate further dilemmas for the solution of which appropriate knowledge bases can be brought about or the already existing ones have to be refined.
A Formal System for Defining the Syntax and Semantics of Computer Languages
, 1969
"... The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the formalism of canonical systems for defining the syntax of a computer language and i ..."
Abstract
 Add to MetaCart
The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the formalism of canonical systems for defining the syntax of a computer language and its translation into a target language, and (2) the formalisms of the lcalculus and extended Markov algorithms as a combined formalism used as the basis of a target language for defining the semantics of a computer language.
DIPLOMARBEIT Development of a Phenotype Algorithm for Particle Geometry Optimization
"... durch ..."