Registrer deg | Logg på | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

ds' library [132 articles]

Nye artikler sendt til ds' bibliotek.
  • A Semantic Analysis of C++ Templates
    by Jeremy Siek, Walid Taha
    posted to c-plus-plus semantic templates by ds on 2008-02-12 13:04:14 as **
  • Call-by-Value Games
    (1998)
    by Samson Abramsky, Guy Mccusker
    edited by Mogens Nielsen, Wolfgang Thomas
    posted to game-semantic by ds on 2007-10-03 11:45:27 as **
  • Observable Sequentiality and Full Abstraction
    (1992), pp. 328-342.
    by Robert Cartwright, Matthias Felleisen
    posted to full-abstraction by ds on 2007-10-03 08:29:38 as ** along with 2 people and 1 group eaubin JacquesC NU-PRL
  • FULL ABSTRACTION AND THE CONTEXT LEMMA
    No. MIT/LCS/TR-524. (1991)
    by T Jim, AR Meyer
    posted to full-abstraction by ds on 2007-10-03 08:29:07 as **
  • A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract)
    (1996), pp. 230-241.
    by Luke CH Ong
    posted to category-theory curry-howard game-semantic type-theory by ds on 2007-10-03 08:28:34 as ****
  • Correspondence between Operational and Denotational Semantics
    (1995), pp. 269-356.
    by CHL Ong
    edited by S Abramsky, D Gabbay, TSE Maibaum
    posted to denotational-semantic full-abstraction higher-types operational-semantic by ds on 2007-10-03 08:25:50 as read along with 1 person leonardo
  • Game-theoretic analysis of call-by-value computation
    Theoretical Computer Science, Vol. 221, No. 1--2. (1999), pp. 393-456.
    by Kohei Honda, Nobuko Yoshida
    posted to game-semantic by ds on 2007-09-28 18:26:47 as **
  • Lectures on the Curry-Howard isomorphism
    (1998)
    by M Srensen, P Urzyczyn
    posted to curry-howard type-theory by ds on 2007-09-03 22:02:05 as ** along with 3 people and 1 group xiemaisi jonathlela fensef AS-IIS_ReadingGroup
  • The Calculus of Constructions and Higher Order Logic
    by J Geuvers
    posted to type-theory by ds on 2007-09-03 21:07:48 as **
  • Static Typing Where Possible, Dynamic Typing When Needed
    Workshop on Revival of Dynamic Languages (2005)
    by Erik Meijer, Peter Drayton
    posted to types by ds on 2007-08-13 22:41:24 as ** along with 6 people and 1 group dherman hamish JeffreyPalmer ben_moseley bunge msakai NU-PRL
  • Growing a Language
    Higher-Order and Symbolic Computation, Vol. 12, No. 3. (1999), pp. 221-236.
    by Guy L Steele
    posted to programming-languages by ds on 2007-08-13 22:40:10 as ** along with 6 people carsonr bunge BenWiedermann Benja ajk brothers
  • C++ Templates are Turing Complete
    by Todd L Veldhuizen
    posted to c-plus-plus templates by ds on 2007-08-13 22:39:46 as ** along with 3 people bi miteshjain nodakai
  • C++ Templates as Partial Evaluation
    (1999), pp. 13-18.
    by Todd L Veldhuizen
    posted to c-plus-plus templates by ds on 2007-08-13 22:39:27 as **
  • Active Libraries and Universal Languages
    (May 2004)
    by Todd L Veldhuizen
    posted to c-plus-plus templates by ds on 2007-08-13 22:39:06 as ** along with 3 people jacob JeffreyPalmer aliguori
  • On the Expressive Power of Programming Languages
    Vol. 432 (1990), pp. 134-151.
    by Matthias Felleisen
    edited by N Jones
    posted to programming-languages by ds on 2007-08-13 22:38:14 as ** along with 19 people and 1 group dherman jacob edcdave kschiess jrw kinaba zednenem water451 ryanc bunge mmuecke KarlKlose calvins pirapira mldechert jsiek dfisher fgeller jkominek NU-PRL
  • Highlights of the history of the lambda-calculus
    (1982), pp. 216-225.
    by Barkley J Rosser
    posted to lambda-calculus by ds on 2007-08-13 22:37:58 as ** along with 9 people and 1 group hamish jrw rahul voigt damaru pintman wadler ben_moseley bunge SRL
  • Functional Programming with Overloading and Higher-Order Polymorphism
    (1995), pp. 97-136.
    by Mark P Jones
    posted to funtional-programming by ds on 2007-08-13 22:36:55 as ** along with 5 people tautologico bunge americovargas yoriyuki pedagand
  • A New Paradox in Type Theory
    Vol. 134 (1994), pp. 555-570.
    by Thierry Coquand
    edited by D Prawitz, B Skyrms, D Westerst\aahl
    posted to type-theory by ds on 2007-08-09 13:32:57 as **
  • Sets and Types: A Review
    by Masood Mortazavi
    posted to types by ds on 2007-08-08 11:28:55 as **
  • The Semantics of Types in Programming Languages
    (1994), pp. 395-475.
    by Carl A Gunter
    edited by S Abramsky, DM Gabbay, TSE Maibaum
    posted to pcf semantic types by ds on 2007-08-08 11:27:15 as **
  • Safety Analysis versus Type Inference
    Information and Computation, Vol. 118, No. 1. (1995), pp. 128-141.
    by Jens Palsberg, Michael I Schwartzbach
    posted to semantic by ds on 2007-08-07 20:59:44 as **
  • Analysis and efficient implementation of functional programs
    (Oct 91)
    by P Sestoft
    posted to compilers funtional-programming by ds on 2007-08-07 20:55:52 as **
  • Efficient Compilation of Lazy Evaluation
    SIGPLAN Notices, Vol. 19, No. 6. (June 1984), pp. 58-69.
    by T Johnsson
    posted to compilers funtional-programming by ds on 2007-08-07 20:51:54 as **
  • Compiling Lazy Functional Languages: An introduction
    by Thomas Johnsson
    posted to compilers funtional-programming by ds on 2007-08-07 20:41:22 as ** along with 4 people jrw tautologico Benja ajk
  • The Impact of the Lambda Calculus on Logic and Computer Science
    Bulletin of Symbolic Logic, Vol. 3, No. 3. (1997), pp. 181-215.
    by Henk Barendregt
    posted to lambda-calculus by ds on 2007-08-07 15:09:13 as *** along with 3 people and 1 group dherman robotact SamB NU-PRL
  • Proof-Assistants Using Dependent Type Systems
    (2001), pp. 1149-1238.
    by Henk Barendregt, Herman Geuvers
    posted to proof-assistant type-theory by ds on 2007-08-07 14:59:37 as ** along with 1 person kontakte
  • Higher Order Logic
    (1994), pp. 229-321.
    by Daniel Leivant
    edited by DM Gabbay, CJ Hogger, JA Robinson
    posted to logic by ds on 2007-08-04 20:24:40 as *** along with 1 person and 1 group rgrig SRG_at_UCD
  • What Rests On What? The Proof-Theoretic Analysis Of Mathematics
    by Solomon Feferman
    posted to foundations by ds on 2007-08-03 09:40:55 as **
  • Typeful Programming
    (1991), pp. 431-507.
    by Luca Cardelli
    edited by EJ Neuhold, M Paul
    posted to programming-languages semantic by ds on 2007-07-26 10:27:16 as ** along with 4 people and 2 groups rgrig amorkan lyongu jimburton SRG_at_UCD Lambda the Ultimate
  • Type Systems
    - (1997)
    by Luca Cardelli
    posted to programming-languages semantic by ds on 2007-07-26 10:26:50 as ** along with 1 person and 1 group mfrydr complogic
  • LAL Is Square: Representation and Expressiveness in Light Affine Logic
    by Peter M Neergaard, Harry G Mairson
    posted to implicit-computational-complexity linear-logic by ds on 2007-07-26 10:19:48 as **
  • Compiler Construction Using Scheme
    (1995), pp. 251-267.
    by Eric Hilsdale, Michael J Ashley, Kent R Dybvig, Daniel P Friedman
    posted to compilers scheme by ds on 2007-07-26 09:45:14 as **
  • Proper Tail Recursion and Space Efficiency
    (1998), pp. 174-185.
    by William D Clinger
    posted to funtional-programming scheme by ds on 2007-07-26 09:42:57 as **
  • Pure Versus Impure Lisp
    ACM Transactions on Programming Languages and Systems, Vol. 19, No. 2. (March 1997), pp. 223-238.
    by Nicholas Pippenger
    posted to complexity funtional-programming by ds on 2007-07-26 09:24:08 as **
  • Equational Theories for Inductive Types
    Annals of Pure and Applied Logic, Vol. 84, No. 2. (1997), pp. 175-217.
    by Ralph Loader
    posted to category-theory lambda-calculus by ds on 2007-07-25 14:16:45 as ** along with 1 person Scis0000002
  • Predicative Foundations of Arithmetic
    Journal of Philosophical Logic, Vol. 24, No. 1. (1975), pp. 1-17.
    by Solomon Feferman, Geoffrey Hellman
    posted to arithmetic by ds on 2007-07-25 14:13:12 as **
  • The Development of Mathematical Logic from Russell to Tarski: 1900-1935
    by Paolo Mancosu, Richard Zach, Calixto Badesa
    posted to logic by ds on 2007-07-25 14:12:16 as **
  • The Mathematical Development of Set Theory from Cantor to Cohen
    The Bulletin of Symbolic Logic, Vol. 2, No. 1. (1996), pp. 1-71.
    by Akihiro Kanamori
    posted to set-theory by ds on 2007-07-25 09:32:29 as ** along with 6 people and 3 groups A_Olympia recordmymind rzach aeagle Scis0000002 ansobol Philosophy_of_Information Blog_and_Wiki_Research LogicPhilMath
  • Understanding Intuitionism
    (1997)
    by E Nelson
    posted to intuitionism by ds on 2007-07-25 09:32:06 as **
  • Applications of Linear Logic to Computation: An Overview
    Bulletin of the IGPL, Vol. 2, No. 1. (1994), pp. 77-107.
    by V Alexiev
    posted to linear-logic by ds on 2007-07-21 17:41:19 as ** along with 1 person tautologico
  • Typability and Type Checking in System F are Equivalent and Undecidable
    Annals of Pure and Applied Logic, Vol. 98, No. 1-3. (1999), pp. 111-156.
    by JB Wells
    posted to lambda-calculus by ds on 2007-07-21 17:39:59 as **
  • Types, Potency, and Idempotency: Why Nonlinearity and Amnesia Make a Type System Work
    by Peter M Neergaard, Harry G Mairson
    posted to proof-theory by ds on 2007-07-21 17:35:18 as **
  • From proof nets to interaction nets
    (1995), pp. 225-247.
    by Y Lafont
    edited by JY Girard, Y Lafont, L Regnier
    posted to linear-logic by ds on 2007-07-21 17:18:30 as **
  • How Light Is Safe Recursion? Compositional Translations between Languages of Polynomial Time
    by Peter M Neergaard, Harry G Mairson
    posted to implicit-computational-complexity linear-logic by ds on 2007-07-21 17:01:14 as **
  • The Essence of Compiling with Continuations
    Vol. 28(6) (1993), pp. 237-247.
    by Cormac Flanagan, Amr Sabry, Bruce F Duba, Matthias Felleisen
    posted to continuations by ds on 2007-07-20 22:18:14 as ** along with 3 people croys clconway mbrentharp
  • The history and status of the P versus NP question
    (1992), pp. 603-618.
    by Michael Sipser
    posted to complexity by ds on 2007-07-19 15:01:05 as **
  • Intensional Semantics of System T of Godel
    Electronic Notes in Theoretical Computer Science, Vol. 35 (2000), pp. 230-243.
    by Pierre Valarcher
    posted to semantic by ds on 2007-07-19 14:58:56 as **
  • A New Characterization of Type-2 Feasibility
    SIAM J. Comput., Vol. 25, No. 1. (1996), pp. 117-132.
    by Bruce M Kapron, Steven A Cook
    posted to complexity higher-types polytime by ds on 2007-07-19 14:57:35 as **
  • An Arithmetic for Polynomial-Time Computation
    by Helmut Schwichtenberg
    posted to implicit-computational-complexity polytime proof-theory by ds on 2007-07-19 14:21:59 as **
  • Feasible computation with higher types
    (2002)
    by H Schwichtenberg
    posted to higher-types implicit-computational-complexity polytime by ds on 2007-07-19 14:14:58 as **
    • NB: Du kan sitere denne siden som: http://www.citeulike.org/user/ds

    Result page: 1 2 3 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.