Search results

Jump to navigation Jump to search
  • File:ExperimentExp8Linux.zip
    Binary of the [[Rodin]] ExperimentExp8 - 8/08/2009. Paper - (en.) included in the archive. For Linux.
    (578 KB) - 16:09, 10 August 2009
  • File:ADFA.png
    The Haskell program from the paper may be trained with examples of numebers in order to get something izomorph
    (626 × 204 (8 KB)) - 11:35, 26 May 2010
  • File:SITC2004.PRN.pdf
    Draft produced during the preparation of a paper concerning Adaptive Automata. It was presented at SITC 2004. Chisinau Rep.
    (300 KB) - 19:31, 3 December 2008
  • File:Expression Problem Solved.pdf
    Exactly one year ago, the oficial .sxw of the paper which solved The Expresssion Problem was released. The .sxw is still there,
    (129 KB) - 20:04, 29 July 2009
  • File:ICMI45-paper-en.pdf
    This paper was scheduled for ICMI45, (2006).
    (299 KB) - 21:54, 29 October 2007
  • ...lace to contribute any post-publication thoughts or observations about the paper, if you wish. ...an about both Haskell and STM in the past few months and not only did this paper greatly increase my knowledge of STM, but it also helped increase my unders
    4 KB (656 words) - 08:12, 6 January 2009
  • ...erhaps someone can expand on the "Another Essence of Dataflow Programming" paper [2].
    360 bytes (53 words) - 02:23, 9 October 2007
  • ...emantics is hiding inside this paper (section 3.1.2 on pages 22--38). This paper is part of the [http://newton.cs.concordia.ca/%7egipsy/ Gipsy Project Home ...w.cs.ioc.ee/~tarmo/papers/aplas05.pdf The Essence of Dataflow Programming] paper written by [http://www.cs.ioc.ee/~tarmo/ Tarmo Uustalu].
    4 KB (593 words) - 15:07, 5 November 2011
  • This is a discussion page for the paper [http://research.microsoft.com/~simonpj/papers/lw-conc Lightweight concurre If you are kind enough to read this paper, you may like to jot down any thoughts it triggers off, and see what others
    3 KB (497 words) - 19:06, 11 February 2008
  • File:Building an interpreter.pdf
    The paper was accepted at ICMI 45, sept 2006, Bacau Romania.
    (275 KB) - 09:33, 27 November 2006
  • File:RodinExperiment10.zip
    ...Haskell Platform 2.0.2 on a clean reinstalled Windows Vista. Examples and paper included. Vector's modules revised. Dan Popa
    (643 KB) - 09:28, 14 August 2009
  • File:Types2.ps
    Draft of the paper : Adaptable Software - Modular Extensible Monadic Entry-pointless Type Chec
    (748 KB) - 16:28, 26 March 2011
  • File:Prolog.pdf
    ...he Prolog Engine (like Andorra) in any DSL you wish. Prolog.pdf was just a paper concerning Prolog used in Mathematics. Published by Creative Math. Baia Mar
    (143 KB) - 05:45, 18 November 2008
  • you should probably read the yampa arcade paper and the original yampa paper
    1 KB (255 words) - 02:45, 11 March 2006
  • == Link to paper is dead ==
    264 bytes (38 words) - 02:12, 13 February 2019
  • File:Image.jpg
    ...niv. of Iasi, Romania indirectly accepted that he was using pages from the paper of Tom Niemann in process of preparing one of his course concerning Compil
    (1,274 × 726 (245 KB)) - 21:21, 5 February 2010
  • This is a discussion page for the paper [[User:ConradParker/InstantInsanity|Type-Level Instant Insanity]]. If you are kind enough to read this paper, you may like to jot down any thoughts it triggers off, and see what others
    3 KB (487 words) - 00:58, 18 November 2011
  • ...the era parameters of signals. See the [[Grapefruit#Publications and talks|paper]] ''Signals, Not Generators!'' and the [http://hackage.haskell.org/packages mentions in his paper ''[http://conal.net/papers/push-pull-frp/ Push-pull functional reactive pro
    2 KB (316 words) - 09:28, 11 November 2011
  • * [http://www.cs.nott.ac.uk/~gmh/bib.html#countdown Graham Hutton] (JFP paper)
    462 bytes (73 words) - 10:20, 13 January 2007
  • the availability of the paper "Type Checking Type Classes". <p><em>The Spineless Tagless G-machine: detailed paper</em>. Simon L Peyton Jones
    4 KB (611 words) - 05:59, 21 August 2007

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)