A reversible SE(M)CD machine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1868, Issue , 2000, Pages 95-113

  Kluge, Werner ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BASIC CONCEPTS; COMPUTING MACHINES; FORWARD-AND-BACKWARD; NORMAL FORM; REVERSE COMPUTATION; STATE TRANSITION RULE;

CALCULATIONS;

EID: 84959051499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722298_6     Document Type: Conference Paper

References (19)

1. Ait-Kuci, H.: The WAM: A (Real) Tutorial, Technical Report, Digital Equipment Corporation, Paris Research Labs, 1990
2. Barendregt, H.P.: The Lambda Calculus, Its Syntax and Semantics, North-Holland, Studies in Logic and the Foundations of Mathematics, Vol. 103, 1981
3. Benett, C.: Logical Reversibility of Computation, IBM Journal of Research and Development, Vol. 17, (1973), pp. 525–532
4. Benioff, P.: The Computer as a Physical System: A Microscopic Quantum Mechanical Hamiltonian Model of Computers as Represented by Turing Machines, Journal of Statistical Physics, Vol. 22, (1980), pp. 563–591
5. Benioff, P.: Quantum Mechanical Models of Turing Machines that Dissipate no Heat, Physical Review Letters, Vol. 48, (1982), pp. 1581–1585
6. Berkling, K.J.: Reduction Languages for Reduction Machines, Proceedings of the 2nd Annual Symposium on Computer Architecture, 1975, ACM/IEEE 75CH0916-7C, pp. 133-140
7. Berkling, K.J.: Computer Architecture for Correct Programming, Proceedings of the 5th Annual Symposium on Computer Architecture, 1978, ACM/IEEE, pp. 78-84
8. Cardelli, L.; McQueen, D.: The Functional Abstract Machine, The ML/LCF/HOPE Newsletter, AT&T, Bell Labs, Murray Hill, NJ, 1983
9. Church, A.: The Calculi of Lambda Conversion, Princeton University Press, 1941
10. Fredkin, E.; Toffoli, T.: Conservative Logic, Int. Journal of Theoretical Physics Vol. 21, (1982), pp. 219–253
11. Gaertner, D.; Kluge, W. E.: π-red+ - an interactive compiling graph reduction system for an applied λ-calculus, Journal of Functional Programming Vol. 6, Part 5, 1996, pp. 723–757
12. Goldson, D. (1994) A Symbolic Calculator for Non-Strict Functional Programs, The Computer Journal, Vol. 37, No. 3, pp. 177–187
13. Hindley, J.R.; Seldin, J.P.: Introduction to Combinators and λ-Calculus, Cambridge University Press, London Mathematical Society Student Texts, 1986
14. Huelsbergen, L.: A logically reversible evaluator for the call-by-name lambda calculus, in: T, Toffoli, M. Biafore, and j. Leao (Ed.) PhysComp96, New England Complex Systems Institute, 1996, pp. 159–167
15. Johnsson, T.: Compiling Lazy Functional Languages, PhD Thesis, Chalmers University of Technology, Goeteborg, 1987
16. Kluge, W.E.: A User's Guide for the Reduction System π-red, Internal Report 9409, Dept. of Computer Science, University of Kiel, Germany, 1994
17. Landin, P.J.: The Mechanical Evaluation of Expressions, The Computer Journal, Vol. 6, No. 4, 1964, pp. 308-320
18. Toffoli, T.: Bicontinuous Extensions of Invertible Combinatorial Functions, Mathematical Systems Theory, Vol. 14, 1981, pp. 13-23
19. Warren, D. H. D.: An Abstract Prolog Instruction Set, Technical Note 309, SRI International, Menlo Park, CA, 1983