Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    b3kat_BV035987833
    Format: 1 Online-Ressource (VI, 413 S.)
    ISBN: 3540159754 , 0387159754
    Series Statement: Lecture notes in computer science 201
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Funktionale Programmiersprache ; Computerarchitektur ; Funktionale Programmierung ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    gbv_595131204
    Format: Online-Ressource (VI, 413 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540396772
    Series Statement: Lecture notes in computer science 201
    Content: Miranda: A non-strict functional language with polymorphic types -- Data flow graph optimization in if1 -- Strictness analysis — a practical approach -- The categorical abstract machine -- High order programming in extended FP -- Secd-m: a virtual machine for applicative programming -- Cobweb — A combinator reduction architecture -- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages -- Lazy memo-functions -- An architecture for fast data movement in the FFP machine -- An architecture that efficiently updates associative aggregates in applicative programming languages -- Lambda lifting: Transforming programs to recursive equations -- Optimizing almost-tail-recursive prolog programs -- Designing regular array architectures using higher order functions -- USDUSDv\mathcal{F}\mathcal{P}USDUSD : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms -- A distributed garbage collection algorithm -- Cyclic reference counting for combinator machines -- Design for a multiprocessing heap with on-board reference counting -- A functional language and modular architecture for scientific computing -- Practical polymorphism -- Program verification in a logical theory of constructions -- Transforming recursive programs for execution on parallel machines -- Compiling pattern matching -- Serial combinators: "optimal" grains of parallelism -- The G-machine: A fast, graph-reduction evaluator.
    Note: Literaturangaben
    Additional Edition: ISBN 3540159754
    Additional Edition: ISBN 0387159754
    Additional Edition: ISBN 9783540159759
    Additional Edition: Erscheint auch als Druck-Ausgabe Functional programming languages and computer architecture Berlin : Springer, 1985 ISBN 3540159754
    Additional Edition: ISBN 0387159754
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Funktionale Programmiersprache ; Computerarchitektur ; Computerarchitektur ; Funktionale Programmierung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_BV000354404
    Format: VI, 413 S. : , graph. Darst.
    ISBN: 3-540-15975-4 , 0-387-15975-4
    Series Statement: Lecture notes in computer science 201
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Funktionale Programmiersprache ; Computerarchitektur ; Funktionale Programmierung ; Konferenzschrift ; Funktionale Computerarchitektur ; Konferenzschrift ; Funktionale Computerarchitektur
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almafu_9959186097202883
    Format: 1 online resource (VIII, 416 p.)
    Edition: 1st ed. 1985.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39677-2
    Series Statement: Lecture Notes in Computer Science, 201
    Note: Bibliographic Level Mode of Issuance: Monograph , Miranda: A non-strict functional language with polymorphic types -- Data flow graph optimization in if1 -- Strictness analysis — a practical approach -- The categorical abstract machine -- High order programming in extended FP -- Secd-m: a virtual machine for applicative programming -- Cobweb — A combinator reduction architecture -- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages -- Lazy memo-functions -- An architecture for fast data movement in the FFP machine -- An architecture that efficiently updates associative aggregates in applicative programming languages -- Lambda lifting: Transforming programs to recursive equations -- Optimizing almost-tail-recursive prolog programs -- Designing regular array architectures using higher order functions -- $$v\mathcal{F}\mathcal{P}$$ : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms -- A distributed garbage collection algorithm -- Cyclic reference counting for combinator machines -- Design for a multiprocessing heap with on-board reference counting -- A functional language and modular architecture for scientific computing -- Practical polymorphism -- Program verification in a logical theory of constructions -- Transforming recursive programs for execution on parallel machines -- Compiling pattern matching -- Serial combinators: "optimal" grains of parallelism -- The G-machine: A fast, graph-reduction evaluator. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-15975-4
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    almahu_9947921001302882
    Format: VIII, 416 p. , online resource.
    ISBN: 9783540396772
    Series Statement: Lecture Notes in Computer Science, 201
    Note: Miranda: A non-strict functional language with polymorphic types -- Data flow graph optimization in if1 -- Strictness analysis — a practical approach -- The categorical abstract machine -- High order programming in extended FP -- Secd-m: a virtual machine for applicative programming -- Cobweb — A combinator reduction architecture -- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages -- Lazy memo-functions -- An architecture for fast data movement in the FFP machine -- An architecture that efficiently updates associative aggregates in applicative programming languages -- Lambda lifting: Transforming programs to recursive equations -- Optimizing almost-tail-recursive prolog programs -- Designing regular array architectures using higher order functions -- $$v\mathcal{F}\mathcal{P}$$ : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms -- A distributed garbage collection algorithm -- Cyclic reference counting for combinator machines -- Design for a multiprocessing heap with on-board reference counting -- A functional language and modular architecture for scientific computing -- Practical polymorphism -- Program verification in a logical theory of constructions -- Transforming recursive programs for execution on parallel machines -- Compiling pattern matching -- Serial combinators: "optimal" grains of parallelism -- The G-machine: A fast, graph-reduction evaluator.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540159759
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9948621648002882
    Format: VIII, 416 p. , online resource.
    Edition: 1st ed. 1985.
    ISBN: 9783540396772
    Series Statement: Lecture Notes in Computer Science, 201
    Note: Miranda: A non-strict functional language with polymorphic types -- Data flow graph optimization in if1 -- Strictness analysis - a practical approach -- The categorical abstract machine -- High order programming in extended FP -- Secd-m: a virtual machine for applicative programming -- Cobweb - A combinator reduction architecture -- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages -- Lazy memo-functions -- An architecture for fast data movement in the FFP machine -- An architecture that efficiently updates associative aggregates in applicative programming languages -- Lambda lifting: Transforming programs to recursive equations -- Optimizing almost-tail-recursive prolog programs -- Designing regular array architectures using higher order functions -- $$v\mathcal{F}\mathcal{P}$$ : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms -- A distributed garbage collection algorithm -- Cyclic reference counting for combinator machines -- Design for a multiprocessing heap with on-board reference counting -- A functional language and modular architecture for scientific computing -- Practical polymorphism -- Program verification in a logical theory of constructions -- Transforming recursive programs for execution on parallel machines -- Compiling pattern matching -- Serial combinators: "optimal" grains of parallelism -- The G-machine: A fast, graph-reduction evaluator.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662180754
    Additional Edition: Printed edition: ISBN 9783540159759
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_1649203489
    Format: Online-Ressource
    ISBN: 9783540396772
    Series Statement: Lecture Notes in Computer Science 201
    Additional Edition: ISBN 9783540159759
    Additional Edition: Buchausg. u.d.T. Functional programming languages and computer architecture Berlin : Springer, 1985 ISBN 3540159754
    Additional Edition: ISBN 0387159754
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Funktionale Programmiersprache ; Computerarchitektur ; Computerarchitektur ; Funktionale Programmierung ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    b3kat_BV000354404
    Format: VI, 413 S. , graph. Darst.
    ISBN: 3540159754 , 0387159754
    Series Statement: Lecture notes in computer science 201
    Language: English
    Subjects: Computer Science , Economics
    RVK:
    RVK:
    Keywords: Funktionale Programmiersprache ; Funktionale Computerarchitektur ; Computerarchitektur ; Funktionale Programmierung ; Konferenzschrift ; Funktionale Computerarchitektur
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    edoccha_9959186097202883
    Format: 1 online resource (VIII, 416 p.)
    Edition: 1st ed. 1985.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39677-2
    Series Statement: Lecture Notes in Computer Science, 201
    Note: Bibliographic Level Mode of Issuance: Monograph , Miranda: A non-strict functional language with polymorphic types -- Data flow graph optimization in if1 -- Strictness analysis — a practical approach -- The categorical abstract machine -- High order programming in extended FP -- Secd-m: a virtual machine for applicative programming -- Cobweb — A combinator reduction architecture -- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages -- Lazy memo-functions -- An architecture for fast data movement in the FFP machine -- An architecture that efficiently updates associative aggregates in applicative programming languages -- Lambda lifting: Transforming programs to recursive equations -- Optimizing almost-tail-recursive prolog programs -- Designing regular array architectures using higher order functions -- $$v\mathcal{F}\mathcal{P}$$ : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms -- A distributed garbage collection algorithm -- Cyclic reference counting for combinator machines -- Design for a multiprocessing heap with on-board reference counting -- A functional language and modular architecture for scientific computing -- Practical polymorphism -- Program verification in a logical theory of constructions -- Transforming recursive programs for execution on parallel machines -- Compiling pattern matching -- Serial combinators: "optimal" grains of parallelism -- The G-machine: A fast, graph-reduction evaluator. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-15975-4
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    edocfu_9959186097202883
    Format: 1 online resource (VIII, 416 p.)
    Edition: 1st ed. 1985.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39677-2
    Series Statement: Lecture Notes in Computer Science, 201
    Note: Bibliographic Level Mode of Issuance: Monograph , Miranda: A non-strict functional language with polymorphic types -- Data flow graph optimization in if1 -- Strictness analysis — a practical approach -- The categorical abstract machine -- High order programming in extended FP -- Secd-m: a virtual machine for applicative programming -- Cobweb — A combinator reduction architecture -- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages -- Lazy memo-functions -- An architecture for fast data movement in the FFP machine -- An architecture that efficiently updates associative aggregates in applicative programming languages -- Lambda lifting: Transforming programs to recursive equations -- Optimizing almost-tail-recursive prolog programs -- Designing regular array architectures using higher order functions -- $$v\mathcal{F}\mathcal{P}$$ : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms -- A distributed garbage collection algorithm -- Cyclic reference counting for combinator machines -- Design for a multiprocessing heap with on-board reference counting -- A functional language and modular architecture for scientific computing -- Practical polymorphism -- Program verification in a logical theory of constructions -- Transforming recursive programs for execution on parallel machines -- Compiling pattern matching -- Serial combinators: "optimal" grains of parallelism -- The G-machine: A fast, graph-reduction evaluator. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-15975-4
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages