3rd SFP 2001: Bridge of Allan, Scotland, UK

> Home > Conferences and Workshops > SFP

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/2001
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/2001
Kevin Hammond, Sharon Curtis:
Selected papers from the 3rd Scottish Functional Programming Workshop (SFP01), University of Stirling, Bridge of Allan, Scotland, August 22nd to 24th, 2001. Trends in Functional Programming 3, Intellect 2002, ISBN 1-84150-070-4
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/RussellSR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/RussellSR01
Dan Russell, Dominic Steinitz, Chris Reade:
Haskell: Language for Business Systems. Scottish Functional Programming Workshop 2001: 1-12
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/Stoughton01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/Stoughton01
Allen Stoughton:
Infinite Pretty-printing in eXene. Scottish Functional Programming Workshop 2001: 13-24
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/Hamilton01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/Hamilton01
Geoff W. Hamilton:
Extending Higher-Order Deforestation: Transforming Programs to Eliminate Even More Trees. Scottish Functional Programming Workshop 2001: 25-36
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/Miller01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/Miller01
Quentin Miller:
BSP in a Lazy Functional Context. Scottish Functional Programming Workshop 2001: 37-50
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/PenaRS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/PenaRS01
Ricardo Pena, Fernando Rubio, Clara Segura:
Deriving Non-Hierarchical Process Topologies. Scottish Functional Programming Workshop 2001: 51-62
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/Loidl01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/Loidl01
Hans-Wolfgang Loidl:
Load Balancing in a Parallel Graph Reducer. Scottish Functional Programming Workshop 2001: 63-74
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/MorazanTN01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/MorazanTN01
Marco T. Morazán, Douglas R. Troeger, Myles Nash:
Paging in a Distributed Virtual Memory. Scottish Functional Programming Workshop 2001: 75-86
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/McAdam01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/McAdam01
Bruce J. McAdam:
How to Repair Type Errors Automatically. Scottish Functional Programming Workshop 2001: 87-98
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/UustaluV01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/UustaluV01
Tarmo Uustalu, Varmo Vene:
The Dual of Substitution is Redecoration. Scottish Functional Programming Workshop 2001: 99-110
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/sfp/WideraB01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/WideraB01
Manfred Widera, Christoph Beierle:
Function Types in Complete Type Inference. Scottish Functional Programming Workshop 2001: 111-122

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.