Copy Link
Add to Bookmark
Report
AIList Digest Volume 4 Issue 109
AIList Digest Friday, 2 May 1986 Volume 4 : Issue 109
Today's Topics:
Bibliography - References #4
----------------------------------------------------------------------
Date: 9 Apr 86 13:21:26 GMT
From: allegra!mit-eddie!think!harvard!seismo!mcvax!ukc!dcl-cs!nott-cs!
abc@ucbvax.berkeley.edu (Andy Cheese)
Subject: Bibliography - References #4
IDA83a *
Ida T. & Sato M. & Hayashi S. & Hagiya M. & Kurokawa T. & Hikita T. &
Futatsugi K. & Sakai K. & Toyama Y. & Matsuda T.
Higher Order: Its Implications to Programming Languages and Computational
Models
ICOT Research Center, Technical Memorandum TM-0029
October 1983
IDA84a *
Ida T. & Konagaya A.
Comparison of Closure Reduction and Combinatory Reduction Schemes.
ICOT Technical Report TR-072
August 1984
INGA78a
Ingalls D.
The Smalltalk-76 Programming System Design and Implementation
Proc. SIGPLAN Conf. on Princ. of Prog. Langs., pp 9-15
1978
INMO84a
INMOS
IMS T424 Transputer Data Card
INMOS , Jan 1984
INMO84b
INMOS
OCCAM Data Card
INMOS , June 1984
INMO84c
INMOS
OCCAM User Group Newsletter No.1
INMOS , Summer 1984
INMO84d
INMOS
IMS T424 Transputer : Preliminary Data
INMOS , August 1984
INMO84e
INMOS ltd
Occam Programming Manual
Prentice Hall International Series in Computer Science
January 1984
ISL81a
Islam N. & Myers T.J. & Broome P.
A Simple Optimiser for FP-like Languages
Proc. ACM Conf. on Functional Programming Languages and Computer
Architecture, New Hampshire, pp 33-40
october 1981
ITO83a *
Ito N. & Masuda K.
Parallel Inference machine Based on the Data Flow Model
( Also in "Proceedings of Int'l Workshop on High-Level Computer Architecture",
Los Angeles, 1984 )
ICOT Research Center, Technical Report TR-033
December 1983
ITO83b
Ito N. & Masuda K. & Shimizu H.
Parallel Prolog Machine Based on the Data Flow Model
ICOT Research Center, Technical report TR-035
September 1983
ITO83c *
Ito N. & Onai R. & Masuda K. & Shimizu H.
Prolog Machine Based on the Data Flow Mechanism
ICOT Research Center, Technical Memorandum TM-0007
May 1983
IWAT84a
Iwata K. & Kamiya S. & Sakai H. & Matsuda S. & Shibayama S. & Murukami K.
Design and Implementation of a Two-Way Merge Sorter and its Application to
Relational Database Processing
ICOT Research Center, Technical Report TR-066
May 1986
JARO86a *
Jarosz J. & Jawarowski J.R.
Computer Tree - The Power of Parallel Computations
Computer Journal, Vol 29, No 2, pp 103-108
April 1986
JAYA80a
Jayaraman B. & Keller R.M.
Resource Control in a Demand-Driven Data-Flow Model
In Proc. International Conf. on Parallel Processing, IEEE
1980
JAYA82a
Jayaraman B. & Keller R.M.
Resource Expressions For Applicative Languages
International Conf. on Parallel Processing, IEEE
August 1982
JEFF85a *
Jeffrey T.
The "mu"PD7281 Processor
Byte Magazine, Vol 10, no 12,
November 1985
JESS86a *
Jesshope C.
VLSI and Beyond
in BCS86a
1986
JESS86b *
Jesshope C.
The Transputer - Microprocessor or Systems Building Block
in BCS86a
1986
JOHN77a
Johnson S.D.
An Interpretive Model For A Language Based On Suspended Construction
M.S. Thesis, Indiana Univ, Bloomington, In.
1977
JOHN81a
Johnsson T.
Detecting When Call By Value can be Used Instead of Call By Need
LPM Memo 14, Chalmers Inst., Sweden
October 1981
JOHN83a
Johnsson T.
The G-Machine. An Abstract Machine for Graph Reduction
Declarative Programming Workshop , University College London, April 1983
JOHN86a *
Johnsson T.
Attribute Grammars and Functional Programming
86-02-20
JONE82a *
Jones N.D. & Muchnick S.S.
A Fixed-Program Machine for Combinator Expression Evaluation
Proc. of ACM LISP Conf 1982 p11-20
JONE83a *
Jones S.B.
Abstract Machine Support For Purely Functional Operating Systems
Technical Monograph PRG-34, Programming Research Group, Oxford Univ.
August 1983
JONK81a *
Jonkers H.B.M.
Abstract Storage Structures
Mathematisch Centrum iw 158/81
1981
KAHN77a *
Kahn G. & MacQueen D.B.
Coroutines and Networks of Parallel Processes
IFIP 77, ed. Gilchrist B. , pp 993-998
North Holland
1977
KAMI84a *
Kamimura T. & Tang A.
Total Objects of Domains
Theoretical Computer Science, pp 275-288
1984
KARI84a *
Karia R.J.
Compiling a Functional Language into Combinators for a Reduction Machine
Computer Science Research Memo no 111
G.E.C. Hirst Research Centre, Computer Science Research Group
6th March 1984
KARP66a *
Karp R.M. & Miller R.E.
Properties of a Model for Parallel Computations : Determinacy, Termination,
Queueing
SIAM Journal on Applied Mathematics, Vol 14, no 6
pp 1390-1411
November 1966
KATE84a
Katevenis M.G.H. & Sherburne R.W. & Patterson D.A. & Sequin C.H.
The RISC II Micro-Architecture
Journal of VLSI and Computer Systems, 1(2)
1984
KATU83a
Katuta T. & Miyazaki N. & Shibayama S. & Yokota H. & Murukami K.
A Relational Database Machine "Delta" - IPSJ Translation
ICOT Research Center, Technical Memorandum TM-0008
May 1983
KAUB82a
Kaubisch W.H. & Hoare C.A.R.
Discrete Event Simulation Based on Communicating Sequential Processes
in BROY82a, pp 625-642
1982
KELL79a
Keller R.M. & Lindstrom G. & Patil S.
A Loosely Coupled Applicative Multi-Processing System
AFIPS Conference Proceedings
June 1979
KELL80a
Keller R.M. & Lindstrom G. & Patil S.
Data-Flow Concepts for Hardware Design
In IEEE Compcon (VLSI - New Architectural Horizons)
February 1980
KELL80b
Keller R.M. & Lindstrom G.
Hierarchical Analysis of a Distributed Evaluator
1980 Int. Conf. on Parallel Processing, IEEE
August 1980
KELL80c
Keller R.M.
Some Theoretical Aspects of Applicative Multiprocessing
In LNCS Proc. Mathematical Foundations of Computer Science
1980
KELL80d
Keller R.M. & Lindstrom G.
Parallelism in Functional Programming Through Applicative Loops
Document 1980
KELL80e
Keller R.M.
Data Structuring in Applicative Multiprocessing Systems
Proc. 1980 LISP Conf. p196-202
KELL81a
Keller R.M. & Yen W.J.
A Graphical Approach to Software Development Using Function Graphs
Proc. Compcon 1981, IEEE
1981
KELL81b
Keller R.M. & Lindstrom G.
Applications of Feedback in Functional Programming
Symp. on Functional Langs. and Computer Arch., Chalmers Univ.
June 1981
KELL82a *
Keller R.M. & Sleep R.S.
Applicative Caching
Document, Dept. of Computer Science, University of Utah,July 1982
KELL84a
Keller R.M. & Lin F.C.H.
Simulated Performance of a Reduction-Based Multiprocessor
Computer 17(7), July 1984
KELL85a
Keller R.M.
FEL (Function-Equation Language) Programmers Guide
AMPS Technical Memorandum No 7, April 1985
KELL85b
Keller R.M. & Lin F.C.H. & Badovinatz
The Rediflow Simulator
Internal Memorandum, April 1985
KELL85c
Keller R.M. & Lindstrom G.
Approaching Distributed Database Implementations Through Functional
Programming Concepts
Proc. 5th Int. Conf. on Distributed Computing Systems, IEEE, Denver
May 1985
KELL85d
Keller R.M.
Distributed Computation by Graph Reduction
Systems Research
Pergammon Press
March 1985
KENN82a *
Kennaway J.R. & Sleep M.R.
Expressions as Processes
Proc. of ACM LISP Conf 1982 p21-28 1982
KENN82b *
Kennaway J.R. & Sleep M.R.
Applicative Objects as Processes
3rd Int. Conf. on Distributed Computing Systems, Miami, Oct 1982
KENN82c *
Kennaway J.R. & Sleep M.R.
Director Strings as Combinators
Document, Computer Studies Centre, University of East Anglia,July 1982
KENN82d *
Kennaway J.R.
The Complexity of a Translation of Lambda-Calculus to Combinators
Document, Computer Studies Centre, University of East Anglia,June 1982
KENN83a *
Kennaway J.R. & Sleep M.R.
Novel Architectures for Declarative Languages
Software & MicroSystems Vol 2 No 3 p59-70 June 1983
KENN83b *
Kennaway J.R. & Sleep M.R.
Syntax and Informal Semantics of DyNe, a Parallel Language
Document, Computer Studies Centre, University of East Anglia, Nov 1983
KENN84a
Kennaway J.R.
An Outline of Some Results of Staples on Optimal Reduction orders
in Replacement Systems
Internal Report CSA/19/1984
Declarative Systems Architecture Group-4
Univ. of East Anglia
20 March 1984
KENN84b
Kennaway J.R. & Sleep M.R.
Efficiency of Counting Director Strings
Internal Report CSA/14/1984
Declarative Systems Architecture Group-2
Univ of East Anglia
May 17 1983
1984
KENN84c
Kennaway J.R. & Sleep M.R.
Counting Director Strings (Draft)
unpublished
Univ of East Anglia
October 31, 1984
KENN85a
Kennaway J.R. & Sleep M.R.
A Denotational Semantics for First-Class Processes (Draft)
Univ of East Anglia
Submitted for publication
August 1985
KENN86a *
Kennaway J.R.
Recursive Normalising L-Strategies For Combinatory Reduction Systems
School of Information Systems, University of East Anglia
March 21, 1986
KIEB81a
Kieburtz R.B. & Shultis J.
Transformations of FP Program Schemes
Proc. ACM Conf. on Functional Programming Languages and Computer
Architecture, New Hampshire, pp 41-48
October 1981
KIEB85a
Kieburtz R.B.
The G-Machine: A Fast Graph-Reduction Evaluator
Oregon Graduate Center Technical Report CS/E-85-002
1985
KITA83a
Kitakami H. & Furukawa K. & Takeuchi A. & Yokota H. & Miyachi T. & Kunifuji S.
A Knowledge Assimilation Method for Logic Databases
( Also in "Proceedings of International Symposium on Logic Programming",
Atlantic City, U.S.A., 1984, IEEE Computer Society Press )
( Also in New Generation Computing, Vol 2, No 4, 1984 )
ICOT Research Center, Technical Report TR-025
September 1985
KITA83b
Kitakami H. & Kunifuji S. & Miyachi T. & Furukawa K.
A Methodology for Implementation of a Knowledge Acquisition System
( Also in "Proceedings of International Symposium on Logic Programming",
Atlantic City, U.S.A., 1984, IEEE Computer Society Press )
ICOT Research Center, Technical Report TR-037
December 1983
KITA83c
Kitakami H. & Kunifuji S. & Miyachi T. & Furukawa K.
A Methodology for Implementation of a Knowledge Acquisition System
ICOT Research Center, Technical Memorandum TM-0024
August 1983
KITS84a
Kitsuregawa M. & Tanaka H. & Moto-oka T.
Relational Algebra Machine GRACE
Faculty of Eng, Dept of Information Eng, Univ of Tokyo
KLEE50a
Kleene S.C.
Introduction to Metamathematics
Von Nostrand, Princeton, 1950
KLUG79a
Kluge W.E.
The Architecture of A Reduction Machine Hardware Model
Gesellschaft Fur Mathematik und Datenverarbeitung MBH Bonn
Tech Rep ISF-Report 79.03,
August 1979
KLUG83a *
Kluge W.E.
Cooperating Reduction Machines
IEEE Transactions on Computers, vol c-32, no 11
pp 1002-1012
November 1983
KNUT70a
Knuth D.E. & Bendix P.B.
Simple Word Problems in Universal Algebra
in "Computational Problems in Abstract Algebra" (ed. Leech J.)
pp 263-297
Pergamon Press
1970
KOND84a
Kondou H.
Plan for Constructing Knowledge Architecture
ICOT Research Center, Technical Report TR-078
September 1984
KOTT75a
Kott L.
About a Transformation System - A Theoretical Study
Proc. 3rd Symposium on Programming, Paris
1975
KOWA74a
Kowalski R.
Predicate logic as a Programming Language
Proc. IFIP, pp 569-574
1974
North Holland
KOWA79a
Kowalski R.
Logic for Problem Solving
North Holland 1979
KOWA79b
Kowalski R.
Algorithm=Logic+Control
CACM Vol 22 No 7 p424-436 July 1979
KOWA80a
Logic as A Computer Language
Infotech State of the Art Conference on Software Development Techniques
1980
KOWA82a
Kowalski R.
Logic Programming
Department of Computing, Imperial College
(Later Presented at IFIP 83, pp 133- 145, North Holland)
KOWA85a
Kowalski R.
The Relationship Between Logic Programming and Logic Specification
in HOA85a
1985
KUCH84a *
Kucherov G.A.
An Algorithm To Recognize Sufficient Completeness Of Algebraic
Specification Of An Abstract Data Type
Programming and Computer Software, 10, pp 161-168
1984
KULK86a *
Kulkarni K.G. & Atkinson M.P.
EFDM: Extended Functional Data Model
Computer Journal, Vol 29, no 1, pp 38-46
1986
KUNI82a
Kunifuji S. & Yokota H.
PROLOG and Relational Data Bases For Fifth Generation Computer Systems
( Also in "Proceedings of CERT Workshop on Logical Bases for Databases",
France, 1982 )
ICOT Research Center, Technical Report TR-002
September 1982
KUNI83a
Kunifuji S. & Enomoto H. & Yonezaki N. & Saeki M.
Paradigms of Knowledge Based Software System and Its Service Image
( Also in Third Seminar on Software Engineering, Florence, 1983 )
ICOT Research Center, Technical Report TR-030
November 1983
KUNI84a
ed. Kunii T.L.
VLSI Engineering
Springer Verlag 1984
KURO84a
Kurokawa T. & Tojyo S.
Coordinator - the Kernel of the Programming System for the Personal
Sequential Inference Machine (PSI)
ICOT Research Center, Technical report TR-061
April 1984
KUSA84a *
Kusalik A.J.
Serialization of Process Reduction In Concurrent Prolog
New Generation Computing 2, pp 289-298
Springer-Verlag
1984
LAMP81a
Lampson B.W. & Pier K.A.
A Processor for a High-Performance Personal Computer
CSL-81-1 , Xerox PARC, Jan 1981
LAMP81b
Lampson B.W. & McDaniel G.A. & Ornstein S.M.
An Instruction Fetch Unit for a High-Performance Personal Computer
CSL-81-1 , Xerox PARC, Jan 1981
LAND63
Landin P.J.
The Mechanical Evaluation of Expressions
Computer Journal 6(4), pp 308-320
(also see A Lambda Calculus Approach in
"Advances in Programming and Non-Numerical Computation"
ed. Fox L., p 67, Pergammon Press, Oxford, 1966)
1963
LAND65
Landin P.J.
A Correspondence Between Algol 60 and Church's Notation
CACM 8, p89
1965
LAND66
Landin P.J.
The Next 700 Programming Languages
CACM Vol 9, no 3, pp 157-166, march
1966
LASS85a *
Lassez J. -L. & Maher M.J.
Optimal Fixedpoints of Logic Programs
Theoretical Computer Science 39, pp 15-25
1985
LEHM81
Lehman M.M.
The Environment of Program Development and Maintenance-
Programs, Programming and Programming Support
Report 81/2
Dept of Computing, Imperial College
1981
LESC83a *
Lescanne P.
Behavioural Categoricity of Abstract Data Type Specifications
Computer Journal, Vol 26, no 4, pp 289-292
1983
LI84a
Li Deyi J.
A Prolog Database System
New York : John Wiley and Sons 1984
LIEB80
Lieberman H. & Hewitt C.E.
A Real Time Garbage Collector That Can Recover Temporary Storage Quickly
AI Memo 569, MIT Lab, Cambridge, 1980
LIEB83
Lieberman H. & Hewitt C.
A Real-Time Garbage Collector Based on the Lifetimes of Objects
CACM Vol 26 No. 6 p419-429 ,June 1983
LIND81
Lindstrom G. & Wagner R.
Incremental Recomputation on Data-Flow Graphs
Symposium on Functional Langs and Comp. Arch., Goteborg Univ.
1981
LIND83
Lindstrom G. & Hunt F.E.
Consistency and Currency in Functional Databases
Proc. Infocom 83, IEEE, San Diego
April 1983
LIND84a
Lindstrom G.
OR-Parallelism on Applicative Architectures
In Proc. 2nd International Logic Programming Conf., Uppsala Univ.
July 1984
LIND84b
Lindstrom G. & Panangaden P.
Stream-Based Execution of Logic Programs
Proc. 1984 Int'l Symp. on Logic Programming
February 1984
LIND85a
Lindstrom G.
Functional Programming and The Logical Variable
In Symposium on Principles of Programming Languages, ACM
January 1985
LIND85b
Lindstrom G.
Rule-Based Programming on Fifth Generation Computers
Proc. A.I. and Advanced Computer Technology Conf., Long Beach
June 1985
LINS85a *
Lins R.D.
The Complexity of a Translation of Lambda-Calculus to Categorical Combinators
University of Kent Computing Laboratory Report No 27
April 1985
LINS85b *
Lins R.D.
A New Formula For The Execution of Categorical Combinators
University of Kent Computing Laboratory Report No 33
November 1985
LINS85c *
Lins R.D.
On The Efficiency of Categorical Combinators as a Rewriting System
University of Kent Computing Laboratory No 34
November 1985
LINS85d
Lins R.D.
A New Way of Introducing Constants in Categorical Combinators
Privately Circulated
Computer Laboratory, Univ of Kent
1985
LOEC84a *
Loeckx J. & Sieber K.
The Foundations of Program Verification
Wiley-Teubner Series in Computer Science
John Wiley and Sons
1984
LONG76a *
Longo G. & Venturini Zilli M.
A Theory of Computation With an Identity Discriminator
Proceedings 3rd International Colloquium on Automata Languages and Programming
pp 147-167
Edinburgh University Press, 1976
MACQ84a *
MacQueen D.
Modules for Standard ML
Proceedings of 1984 ACM Symposium on Lisp and Functional Programming
Austin, Texas
pp 198-207
1984
MAGO79a
Mago G.A.
A Network of R Microprocessors To Execute Reduction Languages
Int. Journal of Computer and Information Sciences
Vol 8 no 5 and Vol 8 no 6
1979
MAGO80a
Mago G.A.
A Cellular Computer Architecture For Functional Programming
Proc. IEEE Compcon , pp 179-187
1980
MAIB85a *
Maibaum T.S.E.
Database Instances, Abstract Data Types and Database Specification
Computer Journal, Vol 28, no 2, pp 154-161
1985
MAL84a
Malpas John & O'Leary Kathy
Declarative Languages Under Unix
Microsystems, August 1984, page 94
MAL85a
Malpas John
Prolog as a unix system tool
unix/world vol II no 6 july '85 pp 48-53
MANNA73a
Manna Z. & Ness S. & Vuillemin J.
Inductive Methods For Proving Properties Of Programs
CACM , August, 1973
MANNA82a
Manna Z.
Verification of Sequential Programs: Temporal Axiomatization
in BROY82a, pp 53-101
1982
MANNI85a *
Mannila H. & Mehlhorn K.
A Fast Algorithm For Renaming a Set of Clauses as a Horn Set
Information Processing Letters, Vol 21, No 5, pp 269-272
November 1985
MANU83a *
Manuel T. & Evanczuk S.
Commercial Products Begin to Emerge From Decades of Research
Electronics, November 3, 1983, pp 127-131
1983
MANU83b *
Manuel T.
Lisp and Prolog Machines are Proliferating
Electronics, November 3, 1983, pp 132-137
1983
MARK77a
Markusz Z.
How to Design Variants of Flats Using Programming Logic-PROLOG based
on Mathematical Logic
Information Processing 77, North Holland 1977
MARK85a *
Markusz Z. & Kaposi A.A.
Complexity Control in Logic-Based Programming
Computer Journal, Vol 28, no 5, pp 487-495
1985
MART85
Martin-Lof P.
Constructive Mathematics and Computer Programming
in HOA85a
1985
MARU84a
Maruyama F. & Mano I. & Hayashi K. & Kakuta T. & Kawado N. & Uehara T.
Prolog-Based Expert System For Logic Design
ICOT Research Center, Technical Report TR-058
April 1984
MATT70
Mattson R.L. & Gecsei J. & Slutz D.R. & Traiger I.L.
Evaluation Techniques for Storage Heirarchies
IBM Syst. J. Vol9 1970 p78-117
MAY83a
May D. & Taylor R.
OCCAM
INMOS Limited, 1983
MAY83b
May D.
OCCAM
ACM Sigplan Notices Vol 18 no 4, pp 69-79
1983
McCAB83
McCabe F.G.
Abstract PROLOG Machine- a Specification
Document Jan. 1983
McCAB85a
McCabe F.G.
Lambda PRLOG
Internal Report, Department of Computing, Imperial College
1985
McCAR60
McCarthy J.
Recursive Functions Of Symbolic Expressions And Their Computation By
Machine, Part 1
CACM, April, 1960
McCAR62
McCarthy J. et al
LISP 1.5 Programmers Manual
MIT Press, 1962
McCAR63
McCarthy J.
A Basis For A Mathematical Theory of Computation
In Computer Programming and Formal Systems
(eds. Brafford P. & Hirschuerg D.)
North Holland
1963
McCAR78
McCarthy J.
The History of LISP
Proceedings of SIGPLAN History of Programming Languages Conference, 1978
MEIR82a *
Meira S.L.
Sorting Algorithms in KRC Implemented in a Functional Programming System
University of Kent Computing Laboratory Report No 14
August 1982
MEIR83
Meira S.R.L.
Sorting Algorithms in KRC: Implementation, Proof and Performance
Computing Laboratory Rep no. 14, Univ. of Kent at Canterbury,
1983
MEIR84a
Meira S.R.L.
A Linear Applicative Solution To The Set Union Problem
Computing Laboratory Tech Rep. no 23,
Univ. of Kent at Canterbury
1984
MEIR84b *
Meira S.R.L.
Optimized Combinatoric Code for Applicative Language Implementation
Computing Laboratory Tech Rep. no 20,
Univ. of Kent at Canterbury
April 1984
MEIR85a *
Meira S.R.L.
On the Efficiency of Applicative Algorithms
Phd Thesis
Univ. of Kent at Canterbury
March 1985
MEIR85b *
Meira S.L.
A Linear Applicative Solution for The Set Union Problem
University of Kent Computing Laboratory Report No 28
May 1985
MEIR85c *
Meira S.L.
A Linear Applicative Solution for the Set Union Problem
Information Processing Letters 20, pp 43-45
2 January 1985
MESE85a *
Meseguer J. & Goguen J.A.
Deduction with Many-Sorted Rewrite
Center for the Study of Language and Information, Stanford University
Report No CSLI-85-42
December 1985
MILN78
Milner R.
A Theory of Type Polymorphism in Programming
J. Computer System Sci 17, pp 348-375
1978
MILN84a *
Milner R.
A Proposal For Standard ML
Proceedings of 1984 ACM Symposium on Lisp and Functional Programming
Austin, Texas
pp 184-197
1984
MILN85a
Milner R.
The Use of Machines to Assist in Rigorous Proof
in HOA85a
1985
MISH84a
Mishra P. & Reddy U.S.
Static Inference of Properties of Applicative Programs
In 11th Annual Symp. on Principles of Programming Languages, ACM
January 1984
MISH85a
Mishra P. & Reddy U.S.
Declaration-Free Type Checking
In Symp. on Principles of Programminmg Languages, ACM
January 1985
MIYA82a
Miyazaki N.
A Data Sublanguage Approach to Interfacing Predicate Logic Languages
and Relational Databases
ICOT TM-001
MIYA84a
Miyazaki N. & Kakuta T. & Shibayama S. & Yokota H. & Murukami K.
An Overview of Relational Database Machine Delta
ICOT Research Center, Technical Report TR-074
August 1984
MIZO85a
Mizoguchi F. & Furukawa K.
Guest Editors' Preface
New Generation Computing Vol 3 No 4, pp 341-344
1985
MOIT85a *
Moitra A.
Automatic Construction of CSP Programs From Sequential Non-Deterministic
Programs
Science of Computer Programming 5 , p277-307
1985
MOKH84a
Mokhoff N.
Parallelism Makes a Strong Bid for Next Generation Computers
Computer Design Vol 23 No 10 Sept 1984
MOON84a *
Moon D. A.
Garbage Collection in a Large LISP System
Proc. of 1984 ACM Conf. on Lisp and Functional Programming
Austin, Texas
pp 235-246
1984
MOOR80a
Moor I. & Darlington J.
A Formal Synthesis Of An Efficient Implementaion For An Abstract Data Type
Internal Report, Dept of Computing, Imperial College
1980
MOOR85a *
Moore R.C.
Possible-World Semantics for Autoepistemic Logic
Center for the Study of Language and Information, Stanford University
Report No CSLI-85-41
December 1985
MORR73
Morris J.H.
Types are not Sets
Proc. ACM Symp. on Princ. of Prog. Langs., pp 120-124, october
1973
MORR80a
Morris J.H. & Schmidt E. & Wadler P.
Experience with an Applicative String Processing Language
Proc. 7th Annual SIGACT-SIGSOFT Symp. on Princ. of Prog. Langs,
Las Vegas, Nevada, 1980
1980
MORR80b
Morris F.L. & Schwarz J.S.
Computing Cyclic List Structures
Proc. of 1980 LISP Conf. p144-153
MORR82a
Morris J.H.
Real Programming in Functional Languages
in DARL82a
1982
MORR82b
Morris J.M.
A General Axiom of Assignment
in BROY82a, pp 25-34
1982
MORR82c
Morris J.M.
Assignment and Linked Data Structures
in BROY82a, pp 35-41
1982
MORR82d
Morris J.M.
A Proof of the Schorr-Waite Algorithm
in BROY82a, pp 43-51
1982
MOTO83a
Moto-oka T.
Overview of the Fifth Generation Computer System Project
Proc. 10th Annual International Symposium on Computer Architecture,
SIGARCH 11(3) ,p417-422
1983
MUKA83a
Mukai K. & Furukawa K.
An Ordered Linear Resolution Theorem Proving Program in Prolog
( Also in "Proceedings of IJPS National Conference", 1983 )
ICOT Research Center, Technical Memorandum TM-0027
September 1983
MUKA85a
Mukai K. & Yasukawa H.
Complex Indeterminates in Prolog and its Application to Discourse Models
New Generation Computing, Vol 3, No 4, pp 441-466
1985
MURA83
Murakami K.
A Relational Data Base Machine: First Step to Knowledge Base Machine
Proc. 10th Annual International Symposium on Computer Architecture,
SIGARCH 11(3) ,p423-425, Sweden
1983
Also ICOT Research Center, Technical Report TR-012
( co authors cited here : Katuta T. & Miyazaki N. & Shibayama S. & Yokota H. )
May 1985
MUSS77
Musser D.R.
A Data Type Verification System based on Rewrite Rules
Proc. of 6th Texas Conference on Computing Systems, Austin, Texas, November
1977
MYCR81a *
Mycroft A.
Abstract Interpretation and Optimising Transformations for
Applicative Programs
PhD Thesis, Univ of Edinburgh
1981
MYCR83
Mycroft A. & Nielson F.
Strong Abstract Interpretation Using Power Domains (Extended Abstract)
Proc 10th Int. Colloq. on Automata, Languages and Programming
Barcelona, Spain, 18-22 July, 1983, pp 536-547
Springer Verlag LNCS no 154 (ed. Diaz J.)
1983
------------------------------
End of AIList Digest
********************
