Listing 1 - 4 of 4 |
Sort by
|
Choose an application
Choose an application
Choose an application
The authors describe here a framework in which the type notation of functional languages is extended to include a notation for binding times (that is run-time and compile-time) that distinguishes between them. Consequently the ability to specify code and verify program correctness can be improved. Two developments are needed, the first of which introduces the binding time distinction into the lambda calculus, in a manner analogous with the introduction of types into the untyped lambda calculus. Methods are also presented for introducing combinators for run-time. The second concerns the interpretation of the resulting language, which is known as the mixed lambda-calculus and combinatory logic. The notion of 'parametrized semantics' is used to describe code generation and abstract interpretation. The code generation is for a simple abstract machine designed for the purpose; it is close to the categorical abstract machine. The abstract interpretation focuses on a strictness analysis that generalises Wadler's analysis for lists.
Choose an application
Molecular biology --- Bioinformatics --- Proteomics --- Biologie moléculaire --- Bio-informatique --- Protéomique --- Data processing --- Congresses. --- Informatique --- Congrès --- Computational Biology --- Systems Biology --- Biology --- Genomics --- Biochemistry --- Chemistry --- Biological Science Disciplines --- Genetics --- Natural Science Disciplines --- Disciplines and Occupations --- Computer Science --- Biophysics --- Engineering & Applied Sciences --- Health & Biological Sciences --- Systems biology. --- Computational biology. --- Bioinformatics. --- Data processing. --- Bio-informatics --- Biological informatics --- Molecular biochemistry --- Molecular biophysics --- Computer science. --- Computers. --- Algorithms. --- Mathematical logic. --- Computer Science. --- Computation by Abstract Devices. --- Mathematical Logic and Formal Languages. --- Algorithm Analysis and Problem Complexity. --- Information science --- Computational biology --- Systems biology --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Algorism --- Algebra --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Informatics --- Science --- Foundations --- Biomolecules --- Biological systems --- Computer software. --- Software, Computer
Listing 1 - 4 of 4 |
Sort by
|