A prological definition of HASL a purely functional language with unification based conditional binding expressions

@article{Abramson2009APD,
  title={A prological definition of HASL a purely functional language with unification based conditional binding expressions},
  author={Harvey Abramson},
  journal={New Generation Computing},
  year={2009},
  volume={2},
  pages={3-35}
}
  • Harvey Abramson
  • Published in New Generation Computing 2009
  • Computer Science
  • We present a definition in Prolog of a new purely funtional (applicative) language HASL (HArvey’s StaticLanguage). HASL is a descendant of Turner’s SASL and differs from the latter in several significant points: it includes Abramson’s unification based conditional binding constructs; it restricts each clause in a definition of a HASL function to have the same arity, thereby complicating somewhat the compilation of clauses to combinators, but simplifying considerably the HASL reduction machine… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES

    Aspects of the Implementation of Programming Languages: The Compilation of an Applicative Language to Combinatory Logic, Ph.D

    • D. A. Turner
    • 1981
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    A Prolog Implementation of SASL

    • IAbramson, H. 1982bJ Abramson
    • Logic Programming Newsletter
    • 1983

    How to define a language using PROLOG

    VIEW 2 EXCERPTS

    C.D.S., The Formal Description of Programming Languages using Predicate Logic, Ph.D

    • Moss, 1981J Moss
    • Thesis, Imperial College,
    • 1981

    LOGLISP - an alternative to Prolog, School or Computer and Information

    • Robinson, Siebert, J. A. 1980aJ Robinson, E. E. Siebert
    • 1980

    SIS - Semantics Implementation System: Reference Manual and User Guide, DAI?vfl MD-30

    • Mosses, 1979J Mosses, Peter
    • 1979

    Recursive Programming Techniques" (Addison-Wesley, 1975)

    • W. H. Burge
    • Notes in Computer Science,
    • 1978