Paul Hudak

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Adrienne G. Bloss

> Home > Persons > Paul Hudak

Publications

1989
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/cj/BlossHY89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cj/BlossHY89
Adrienne G. Bloss, Paul Hudak, Jonathan Young:
An Optimising Compiler for a Modern Functional Language. Comput. J. 32(2): 152-161 (1989)
1988
[j7]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/lisp/BlossHY88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lisp/BlossHY88
Adrienne G. Bloss, Paul Hudak, Jonathan Young:
Code Optimizations for Lazy Evaluation. LISP Symb. Comput. 1(2): 147-164 (1988)
1987
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/mfps/BlossH87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfps/BlossH87
Adrienne G. Bloss, Paul Hudak:
Path Semantics. MFPS 1987: 476-489
1986
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/lfp/BlossH86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lfp/BlossH86
Adrienne G. Bloss, Paul Hudak:
Variations on Strictness Analysis. LISP and Functional Programming 1986: 132-142
1985
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/popl/HudakB85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/popl/HudakB85
Paul Hudak, Adrienne G. Bloss:
The Aggregate Update Problem in Functional Programming Systems. POPL 1985: 300-314

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.