新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

dalev library [34 articles]

最近 dalev さんのライブラリ .
  • Untitled
  • Categorical Logic
    (2001)
    by Andrew M Pitts
    edited by S Abramsky, DM Gabbay, TSE Maibaum
  • A Monadic Categorical Semantics for Threads
    by Jonathan Sobel, Steven E Ganz, Daniel P Friedman, Mitchell Wand
  • Trampolining Architectures
    by Steven E Ganz, Daniel P Friedman
  • Generic unification via two-level types and parameterized modules
    Vol. 36, No. 10. (October 2001), pp. 86-97.
    by Tim Sheard
  • Nominal unification
    Theor. Comput. Sci., Vol. 323, No. 1-3. (2004), pp. 473-497.
    by Christian Urban, Andrew M Pitts, Murdoch J Gabbay
  • Nominal rewriting systems
    (2004), pp. 108-119.
    by Maribel Fern&\#225;ndez, Murdoch J Gabbay, Ian Mackie
  • Safety analysis versus type inference
    Inf. Comput., Vol. 118, No. 1. (April 1995), pp. 128-141.
    by Jens Palsberg, Michael I Schwartzbach
  • A first-order one-pass CPS transformation
    Theor. Comput. Sci., Vol. 308, No. 1-3. (2003), pp. 239-257.
    by Olivier Danvy, Lasse R Nielsen
  • A generic account of continuation-passing styles
    (1994), pp. 458-471.
    by John Hatcliff, Olivier Danvy
  • CPS transformation of flow information
    J. Funct. Program., Vol. 13, No. 5. (September 2003), pp. 905-923.
    by Jens Palsberg, Mitchell Wand
  • Syntactic accidents in program analysis: on the impact of the CPS transformation
    J. Funct. Program., Vol. 13, No. 5. (September 2003), pp. 867-904.
    by Daniel Damian, Olivier Danvy
    posted to analysis-accuracy cps static-analysis by dalev on 2005-08-02 04:18:34 as ** along with 1 group NU-PRL
  • Verifying CPS transformations in Isabelle/HOL
    (2003), pp. 1-8.
    by Yasuhiko Minamide, Koji Okuma
  • Some Lambda Calculus and Type Theory Formalized
    J. Autom. Reason., Vol. 23, No. 3. (November 1999), pp. 373-409.
    by James Mckinna, Robert Pollack
  • On understanding types, data abstraction, and polymorphism
    ACM Comput. Surv., Vol. 17, No. 4. (December 1985), pp. 471-523.
    by Luca Cardelli, Peter Wegner
  • The view from the left
    J. Funct. Program., Vol. 14, No. 1. (January 2004), pp. 69-111.
    by Conor Mcbride, James Mckinna
  • Type checking dependent (record) types and subtyping
    J. Funct. Program., Vol. 10, No. 2. (March 2000), pp. 137-166.
    by Gustavo Betarte
  • Faking it Simulating dependent types in Haskell
    J. Funct. Program., Vol. 12, No. 5. (July 2002), pp. 375-392.
    by Conor Mcbride
  • The scheme 311 compiler an exercise in denotational semantics
    (1984), pp. 356-364.
    by William Clinger
  • A poor man's concurrency monad
    J. Funct. Program., Vol. 9, No. 3. (May 1999), pp. 313-323.
    by Koen Claessen
  • Quasiquotation in Lisp
    (1999), pp. 4-12.
    by Alan Bawden
  • Reflective metalogical frameworks
    ACM Trans. Comput. Logic, Vol. 5, No. 3. (July 2004), pp. 528-576.
    by David Basin, Manuel Clavel, Jos&\#233; Meseguer
  • The mystery of the tower revealed: a non-reflective description of the reflective tower
    (1986), pp. 298-307.
    by Mitchell Wand, Daniel P Friedman
  • Duplication and partial evaluation --- for a better understanding of reflective languages -
    Lisp and Symbolic Computation, Vol. 9, No. 2/3. (/ 1996), pp. 203-241.
    by Kenichi Asai, Satoshi Matsuoka, Akinori Yonezawa
  • Making Reliable Distributed Systems in the Presence of Software Errors
    by Joe Armstrong
  • Denotational proof languages
    (2000)
    by Konstantinos Arkoudas
  • Explicit substitutions
    (1990), pp. 31-46.
    by M Abadi, PL Curien, JJ Levy
  • Symbolic Simulation: An ACL2 Approach
    (1998), pp. 334-350.
    by Strother S Moore
  • An Industrial Strength Theorem Prover for a Logic Based on Common Lisp
    Software Engineering, Vol. 23, No. 4. (1997), pp. 203-213.
    by Matt Kaufmann, Strother S Moore
  • Cryptofibring (Extended Abstract)
    by Carlos Caleiro, Jaime Ramos
  • Fibring logics with topos semantics
    Journal of Logic and Computation, in print.
  • Mechanisms for combining logics
    (1999)
  • Program fragments, linking, and modularization
    (1997), pp. 266-277.
    by Luca Cardelli
  • A New Approach to Abstract Syntax Involving Binders
    (1999), pp. 214-224.
    by Murdoch Gabbay, Andrew Pitts
    edited by G Longo
  • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/dalev

    RIS BibTeX RSS
    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.