Rewriting 기반 프로그래밍

  • Published : 1997.01.01

Abstract

Keywords

References

  1. The Implementation of Functional Programming Languages S.Peyton Jones
  2. Handbook of Theoretical Computer Science v.B Rewrite System N.Dershowitz;J.P.Jouannaud;J.van Leeuwen(ed.)
  3. Handbook of Logic in Compute Science v.2 Term Rewriting Systems J.W.Klop;S.Abramsky(et al)(ed.)
  4. The Lambda Calculus, its Syntax and Semantics (revised edition) H.P.Barendregt
  5. Introduclion to Combunators and Lambda Calculus J.R.Hindley;J.P.Seldin
  6. PARLE Conference Proceedings, Lecture Notes in Computer Science 259 v.2 Term Graph Rewriting H.P.Barendregt(et al.);J.W.deBakker(et al.)(ed.)
  7. Computational Logic: Essays in Honour of Alan Robinsons Call-by-need Computation in Non-ambiguous Linear Term Rewriting Systems G.Huet;J.J.Levy;J.L.Lassez(ed.);G.Plotkin(ed.)
  8. Annals of Pure and Applied Logic v.43 Sequential Evaluation Strategies for Parallel-Or and Related Reduction Systems J.R.Kennaway
  9. TermGraph Rewriting Theory and Practice The Functional Strategy and Transitive Term Rewriting Systems Y.Toyama(et al.);M.R.Sleep(ed.);M.J.Plasmeijer(ed.);M.C.J.D.van Eekelen(ed.)
  10. D.Phil. thesis, Programming Research Group, Oxford University Semantics and Pragmatics of the Lambda Calculus C.P.Wadsworth
  11. Logic and Algebra of Spectfication The Polyadic π-calculus: a Tutorial R.Milner;F.L.Bauer(et al.)(ed.)
  12. Theoretical Computer Science v.50 Linear Logic: Its Syntax and Semantics J.Y.Girard