注册 | 登录 | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

JacquesC's library [76 articles]

最近录入 JacquesC's ordered by to_read.
  • Monad transformers and modular interpreters
    (1995), pp. 333-343.
    by Sheng Liang, Paul Hudak, Mark Jones
  • Generalized symbolic execution for model checking and testing
    (2003)
  • Generalized Functions and Infinitesimals
    (8 Oct 2006)
    by Jf
    posted to generalized-functions infinitesimals by JacquesC on 2006-10-10 15:35:58 as *** along with 1 group NU-PRL
  • CPS Translations and Applications: The Cube and Beyond (Preliminary Report)
    (1996)
    by Gilles Barthe, John Hatcliff, MHB Morten
    edited by O Danvy
  • notes Combining decision procedures for the reals
    (31 Jan 2006)
    by Jeremy Avigad, Harvey Friedman
  • Automatic enumeration of regular objects
    (12 Jul 2005)
    by Marni Mishna
    posted to d-finite species by JacquesC on 2005-08-03 18:19:59 as *** along with 1 group NU-PRL
  • Building interpreters by composing monads
    (1994), pp. 472-492.
    by Guy Steele
    edited by Ac
  • Learning the parts of objects by non-negative matrix factorization.
    Nature, Vol. 401, No. 6755. (21 October 1999), pp. 788-791.
    by DD Lee, HS Seung
  • Observable Sequentiality and Full Abstraction
    (1992), pp. 328-342.
    by Robert Cartwright, Matthias Felleisen
  • Notable design patterns for domain-specific languages
    J. Syst. Softw., Vol. 56, No. 1. (February 2001), pp. 91-99.
    by Diomidis Spinellis
  • Linear Abadi and Plotkin Logic
    (1 Nov 2006)
    by Lars Birkedal, Rasmus E Møgelberg, Rasmus L Petersen
  • Towards a Type System for Analyzing JavaScript Programs
    European Symposium On Programming (2005)
    by Peter Thiemann
  • The Formulae-as-Types Notion of Control
    (1990), pp. 47-57.
    by Timothy G Griffin
  • Towards Applicative Relational Programming
    (28 Feb 2006)
  • Implementing an Efficient Theorem Prover
    (2003)
    by Alexandre Riazanov
    posted to theorem-provers by JacquesC on 2006-02-01 18:18:42 as ** along with 1 person and 1 group stavros NU-PRL
  • Linear Contexts and the Sharing Functor: Techniques for Symbolic Computation
    Thirty Five Years of Automating Mathematics (2003)
    by Gérard Huet
    edited by Fairouz Kamareddine
  • Strongly typed heterogeneous collections
    (2004), pp. 96-107.
    by Oleg Kiselyov, Ralf L&\#228;mmel, Keean Schupke
  • Bananas in space: extending fold and unfold to exponential types
    (1995), pp. 324-333.
    by Erik Meijer, Graham Hutton
  • Implementing extensible theorem provers
    (1999)
  • Modular Object-Oriented Programming with Units and Mixins
    Vol. 34(1) (1999), pp. 94-104.
    by Robert B Findler, Matthew Flatt
  • Quasiquotation in Lisp
    (1999), pp. 4-12.
    by Alan Bawden
  • The Expression Problem Revisited
    European Conference on Object-Oriented Programming (2004)
    by Mads Torgersen
  • Theorems for Free!
    (1989), pp. 347-359.
    by Philip Wadler
  • Linear types can change the world!
    (1990), pp. 347-359.
    by P Wadler
    edited by M Broy, C Jones
  • Concatenate, reverse and map vanish for free
    Vol. 37, No. 9. (September 2002), pp. 14-25.
  • What is beautiful is usable
    Interacting with Computers, Vol. 13, No. 2. (December 2000), pp. 127-145.
    by N Tractinsky, A Katz, D Ikar
  • Principles of programming with complex objects and collection types
    Theoretical Computer Science, Vol. 149, No. 1. (1995), pp. 3-48.
    by Peter Buneman, Shamim Naqvi, Val Tannen, Limsoon Wong
  • A Modal $λ$ Calculus with Iteration and Case Constructs
    No. RR-3322.
    by Pierre Leleu
  • Modular Domain Specific Languages and Tools
    (1998), pp. 134-142.
    by Paul Hudak
    edited by P Devanbu, J Poulin
  • Meta-programming With Built-in Type Equality
    by Exte N Ed
  • Monadic Parser Combinators
    No. NOTTCS-TR-96-4. (1996)
    by Graham Hutton, Erik Meijer
  • Information flow analysis in logical form
    (2004)
  • How to make ad-hoc polymorphism less ad hoc
    (1989), pp. 60-76.
    by P Wadler, S Blott
  • Recursion is a computational effect
    (2000)
    by D Friedman, A Sabry
  • Continuation-Based Program Transformation Strategies
    J. ACM, Vol. 27, No. 1. (January 1980), pp. 164-180.
    by Mitchell Wand
  • Implementation Strategies for First-Class Continuations
    Higher Order Symbol. Comput., Vol. 12, No. 1. (April 1999), pp. 7-45.
    by William D Clinger, Anne H Hartheimer, Eric M Ost
  • Representing monads
    (1994), pp. 446-457.
    by Andrzej Filinski
  • Models of continuations without continuations
    (1991), pp. 185-196.
    by Dorai Sitaram, Matthias Felleisen
  • The similarity metric
    (5 August 2004)
    by Ming Li, Xin Chen, Xin Li, Bin Ma, Paul Vitanyi
  • An information-theoretic definition of similarity
    (1998), pp. 296-304.
    by Dekang Lin
  • Predicate Dispatching: A Unified Theory of Dispatch
    Vol. 1445 (1998), pp. 186-211.
    by Michael D Ernst, Crag Kaplan, Craig Chambers
  • Combinators for Layered Software Architectures
    by Martijn M Schrage, Johan Jeuring, Doaitse Swierstra
  • A Bytecode-Compiled, Type-safe, Multi-Stage Language
    by Cristiano Calcagno, Walid Taha, Liwen Huang, Xavier Leroy
  • Compiling Embedded Languages
    (2000), pp. 9-27.
    by Conal Elliott, Sigbjorn Finne, Oege d de Moor
  • DSL implementation using staging and monads
    (1999), pp. 81-94.
    by Tim Sheard, Zine-El-Abidine Benaissa, Emir Pasalic
  • Putting Type Annotations to Work
    (1996), pp. 54-67.
    by Martin Odersky, Konstantin Läufer
  • A monadic combinator compiler compiler
    (2001)
  • Domain specific embedded compilers
    (1999), pp. 109-122.
    by Daan Leijen, Erik Meijer
  • Synthesizing Object-Oriented and Functional Design to Promote Re-Use
    (1998), pp. 91-113.
    by Shriram Krishnamurthi, Matthias Felleisen, Daniel P Friedman
  • An introduction to Grothendieck topologies, fibered categories and descent theory
    (28 December 2004)
    by Angelo Vistoli
  • ◇温馨提示◇本页的引用地址为: http://www.citeulike.org/user/JacquesC/order/to_read

    Result page: 1 2 Next RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.