Haskell before Haskell: an alternative lesson in practical logics of the ENIAC.

Saved in:
Bibliographic Details
Title: Haskell before Haskell: an alternative lesson in practical logics of the ENIAC.
Authors: DE MOL, LIESBETH1 elizabeth.demol@ugent.be, CARLÉ, MARTIN mc@aiguphonie.com, BULLYNCK, MAARTEN2 maarten.bullynck@kuttaka.org
Source: Journal of Logic & Computation. Aug2015, Vol. 25 Issue 4, p1012-1046. 36p.
Subjects: Haskell (Computer program language), Programming languages, Interpolation, Computable functions, Combinatory logic, ENIAC (Computer)
Abstract: This article expands on Curry's work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program composition (1948-1950). It is shown that Curry's hands-on experience with the ENIAC on the one side and his acquaintance with systems of formal logic on the other, were conductive to conceive a compact 'notation for program construction' which in turn would be instrumental to a mechanical synthesis of programs. Since Curry's systematic programming technique pronounces a critique of the Goldstine-von Neumann style of coding, his 'calculus of program composition' not only anticipates automatic programming but also proposes explicit hardware optimizations largely unperceived by computer history until Backus' famous ACM Turing Award lecture (1977). The cohesion of these findings asks for an integrative historiographical approach. An appendix gives, for the first time, a full description of Curry's arithmetic compiler. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 108922879
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Haskell before Haskell: an alternative lesson in practical logics of the ENIAC.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22DE+MOL%2C+LIESBETH%22">DE MOL, LIESBETH</searchLink><relatesTo>1</relatesTo><i> elizabeth.demol@ugent.be</i><br /><searchLink fieldCode="AR" term="%22CARLÉ%2C+MARTIN%22">CARLÉ, MARTIN</searchLink><i> mc@aiguphonie.com</i><br /><searchLink fieldCode="AR" term="%22BULLYNCK%2C+MAARTEN%22">BULLYNCK, MAARTEN</searchLink><relatesTo>2</relatesTo><i> maarten.bullynck@kuttaka.org</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Aug2015, Vol. 25 Issue 4, p1012-1046. 36p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Haskell+%28Computer+program+language%29%22">Haskell (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Interpolation%22">Interpolation</searchLink><br /><searchLink fieldCode="DE" term="%22Computable+functions%22">Computable functions</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatory+logic%22">Combinatory logic</searchLink><br /><searchLink fieldCode="DE" term="%22ENIAC+%28Computer%29%22">ENIAC (Computer)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This article expands on Curry's work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program composition (1948-1950). It is shown that Curry's hands-on experience with the ENIAC on the one side and his acquaintance with systems of formal logic on the other, were conductive to conceive a compact 'notation for program construction' which in turn would be instrumental to a mechanical synthesis of programs. Since Curry's systematic programming technique pronounces a critique of the Goldstine-von Neumann style of coding, his 'calculus of program composition' not only anticipates automatic programming but also proposes explicit hardware optimizations largely unperceived by computer history until Backus' famous ACM Turing Award lecture (1977). The cohesion of these findings asks for an integrative historiographical approach. An appendix gives, for the first time, a full description of Curry's arithmetic compiler. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=108922879
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/logcom/exs072
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 36
        StartPage: 1012
    Subjects:
      – SubjectFull: Haskell (Computer program language)
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Interpolation
        Type: general
      – SubjectFull: Computable functions
        Type: general
      – SubjectFull: Combinatory logic
        Type: general
      – SubjectFull: ENIAC (Computer)
        Type: general
    Titles:
      – TitleFull: Haskell before Haskell: an alternative lesson in practical logics of the ENIAC.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: DE MOL, LIESBETH
      – PersonEntity:
          Name:
            NameFull: CARLÉ, MARTIN
      – PersonEntity:
          Name:
            NameFull: BULLYNCK, MAARTEN
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2015
              Type: published
              Y: 2015
          Identifiers:
            – Type: issn-print
              Value: 0955792X
          Numbering:
            – Type: volume
              Value: 25
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Journal of Logic & Computation
              Type: main
ResultId 1