ヒビルテ [論文]

論文

2001-11-14#p03 マルチバイトキャラクタを扱う決定性有限状態オートマトンの構成法
2002-03-07#p02 論文読み会
2002-03-15#p03 論文読み会
2002-03-19#p01 論文読み会
2002-03-22#p01 論文読み会 “Virtualizing I/O Devices on VMware Workstation's Hosted Virtual Machine Monitor”
2002-04-01#p03 論文読み会
2002-04-03#p01 On Understanding Types, Data Abstraction, and Polymorphism
2002-04-06#p05 On Understanding Types, Data Abstraction, and Polymorphism
2002-04-16#p01 Monads for functional programming
2002-04-19#p01 Regular Expressions into Finite Automata
2002-04-22#p07 論文読み会 "WOLF--A Novel Reordering Write Buffer to Boost the Performance of Log-Structured File Systems"
2002-04-25#p01 A Categorical Programming Language
2002-04-27#p02 Efficient Object Sampling via Weak References
2002-04-28#p01 Lazy vs. strict
2002-04-30#p03 外国語論文講読: Types and Programming Languages
2002-05-13#p03 論文読み会 "Rethinking /dev and devices in the UNIX kernel"
2002-05-20#p04 論文読み会 "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications"
2002-05-21#p03 Coalgebra に基づく有限オートマトン理論の再構成(概要)
2002-06-03#p03 論文読み会 "J-Orchestra: Automatic Java Application Partitioning"
2002-06-07#p06 Generic Programming - An Introduction -
2002-06-10#p03 論文読み会 "A Secure Environment for Untrusted Helper Applicatoins"
2002-06-17#p03 論文読み会 "Clarifying the Fundamentals of HTTP" by Jeffrey C.Mogul, Compaq Research, IETF HTTP WG
2002-06-20#p04 A Block-sorting Lossless Data Compression Algorithm
2002-06-24#p01 Subtyping and Inheritance for Categorical Datatypes
2002-06-24#p02 論文読み会 "Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems"
2002-07-01#p03 論文読み会 "Consistency Management in Optimistic Replication Algorithms"
2002-08-23#p02 PRIMES is in P
2002-08-31#p02 Functional Programming with Overloading and Higher-Order Polymorphism
2002-09-04#p01 素数判定とMillerの定理
2002-09-20#p07 Collection Schemes For Distributed Garbage
2002-09-30#p07 論文読み会 "How to Model an Internetworking"
2002-10-03#p01 The new Native POSIX Thread Library for Linux (draft)
2002-10-04#p04 Strong Categorical Datatypes I
2002-10-07#p05 論文読み会 "Disk Scheduling Revisited"
2002-10-10#p10 Fold and Unfold for Program Semantics
2002-10-21#p06 論文読み会 "The new Native POSIX Thread Library for Linux" (draft)
2002-10-24#p05 From Algebras and Coalgebras to Dialgebras
2002-10-28#p05 論文読み会 "Java 2 Platform Micro Edition"
2002-11-01#p04 Java/C++ integration
2002-11-05#p06 Haskell and XML: Generic Combinators or Type-Based Translation?
2002-11-07#p06 Lexical File Names in Plan 9, or, Getting Dot-Dot Right
2002-11-11#p04 論文読み会: rfc2291
2002-11-18#p08 論文読み会 "PersonalRAID: Mobile Storage for Distributed and Disconnected Computers"
2002-11-21#p05 Template metaprogramming for Haskell
2002-12-05#p05 Computational lambda-calculus and monads.
2002-12-07#p03 Magazines and Vmem: Extending the Slab Allocator to Many CPUs and Arbitrary Resources
2002-12-09#p08 論文読み会 "Summary of Recent Discussions about an Application Prgramming Interface from RDF"
2002-12-12#p06 From Direct Style to Monadic Style through CPS
2002-12-16#p06 論文読み会 "Java バイトコードを編集するためのAPI"
2002-12-21#p01 fold,自由代数,表示的意味論
2003-01-20#p01 論文読み会 "Fold and Unfold for Program Semantics"
2003-01-21#p02 "Sketches: Outline with references"
2003-02-24#p01 論文読み会: DCD----Disk Caching Disk: A New Approach for Boosting I/O Performance
2003-05-01#p04 超集合論 - circularityの論理の現在 -
2003-05-15#p04 安全に結合可能なアスペクトを提供するためのルール
2003-05-18#p05 ワイヤレスネットワークの脆弱性の実証とWEPを使う上での対策
2003-06-04#p01 木下佳樹, 高橋孝一: 『図式による圏論の形式的証明』, 電子技術総合研究所研究速報, TR95-25, 1995.
2003-06-05#p01 横山哲郎, 『効果的な融合変換のための変換戦略の記述法とその実現』
2003-06-09#p02 Nested Type
2003-06-10#p04 Charity User Manual (draft)
2003-06-18#p05 A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
2003-06-19#p02 Linear Types Can Change the World!
2003-06-23#p03 Final Coalgebras are Ideal Completions of Initial Algebras
2003-06-27#p07 Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
2003-06-29#p03 「自己言及の論理と計算」 (長谷川真人)
2003-07-04#p02 On coalgebra based on classes (J. Adámek, S. Milius, J.Velebil)
2003-08-14#p05 Decomposing Typed Lambda Calculus Into a Couple of Categorical Programming Languages
2003-09-01#p05 Any endo-functor on the class of all classes is set-based. (J. Adámek, S. Milius, J.Velebil: On coalgebra based on classes)
2003-11-05#p06 Relators, Fans and Membership
2003-11-05#p09 論文積読
2003-11-06#p02 Coalgebras and Monads in Semantics of Java
2004-01-08#p02 Citrus iconv の実装
2004-01-28#p02 Detours: Binary Interception of Win32 Functions
2004-02-10#p01 IF-Map: An Ontology-Mapping Method based on Information-Flow Theory
2004-04-03#p01 Polymorphism is not set-theoretic
2004-04-10#p01 John Hughes, "Generalising Monads to Arrows"
2004-04-24#p01 "Typing Haskell in Haskell", Mark P. Jones
2004-04-27#p01 "Language-Based Information-Flow Security", Andrei Sabelfeld and Andrew C. Myers
2004-04-28#p01 "Institution Morphisms", Joseph Goguen, Grigore Rosu
2004-05-01#p03 "A denotational semantics of inheritance and its correctness", William Cook and Jens Palsberg
2004-05-23#p01 "Restricted Datatypes in Haskell", John Hughes (Chalmers University, Sweden)
2004-05-29#p04 "A New Notation for Arrows", Ross Paterson
2004-06-02#p01 Closed Freyd- and kappa-categories, John Power and Hayo Thielecke
2004-06-12#p01 "部分グラフ同型判定アルゴリズムのFPGAによる実装と評価", 市川周一, ラターナセンタン・ウドーン(Lerdtanaseangtham Udorn), 小西幸治
2004-06-29#p01 V. Vene. Categorical programming with inductive and coinductive types. Diss. Math. Uni. Tartuensis, v. 23, Uni. of Tartu, Aug. 2000. - .ps.gz, .pdf.
2004-07-03#p03 Bananas in Space: extending Fold and Unfold to Exponential Types
2004-07-27#p02 Enumerating the Rationals.
2004-07-28#p01 FREYD, P. J. 1990. Recursive Types Reduced to Inductive Types. In Proceedings 5th IEEE Annual Symp. on Logic in Computer Science, LICS'90 (Philadelphia, PA, USA, 4-7 June 1990). IEEE Computer Society Press, Los Alamitos, CA, 498-507.
2004-08-02#p01 "擬データを用いた対話的関数プログラミングに関する研究", 石井裕一郎
2004-08-04#p01 "Inductive, coinductive, and pointed types", Brian T. Howard
2004-08-05#p02 "RAL: an Algebra for Querying RDF", Flavius Frasincar, Geert-Jan Houben, Richard Vdovjak, Peter Barna (PDF, PS, PPT)
2004-08-12#p02 "Purely Functional Data Structures", Chris Okasaki
2004-08-21#p01 "Non-stop Haskell", Andy Cheadle, Tony Field, Simon Marlow, Simon Peyton Jones, and Lyndon While; ICFP 2000.
2004-08-22#p02 "Lazy functional state threads", John Launchbury, Simon L. Peyton Jones
2004-08-23#p01 論文読み会
2004-08-24#p02 "A New Method for Functional Arrays", Melissa O'Neill, F. Warren Burton
2004-08-25#p02 "Generational garbage collection for Haskell", Patrick M. Sansom, Simon L. Peyton Jones
2004-08-26#p01 Jan-Åke Hedström, "RubySharp - a Ruby to CIL Compiler", [PDF]
2004-08-26#p02 Anders Alexandersson, "RubyComp - a Ruby-to-LLVM Compiler Prototype", [PDF]
2004-08-29#p05 "Compiling Haskell to Java", Mark Tullsen
2004-09-02#p03 "Graph Rewriting Semantics for Functional Programming Language", Marko van Eekelen, Sjaak Smetsers, Rinus Plasmeijer
2004-09-03#p02 "Type Classes with Functional Dependencies", Mark P. Jones
2004-11-16#p01 Making a fast curry: push/enter vs. eval/apply for higher-order languages, Simon Marlow and Simon Peyton Jones
2004-11-17#p01 Lazy Depth-First Search and Linear Graph Algorithms in Haskell, David J. King and John Launchbury
2004-12-09#p04 Tarmo Uustalu, Varmo Vene and Alberto Pardo, Comonadic Iteration
2004-12-14#p03 Constructed Product Result Analysis for Haskell, Clem Baker-Finch, Kevin Glynn, Simon Peyton Jones
2005-01-21#p01 Composable memory transactions, Tim Harris, Simon Marlow, Simon Peyton Jones, and Maurice Herlihy. Submitted to PPoPP 2005.
2005-01-26#p01 Strongly typed heterogeneous collections, Oleg Kiselyov, Ralf Lämmel, and Keean Schupke
2005-01-26#p02 Haskell's overlooked object system, Oleg Kiselyov, Ralf Lämmel, and Keean Schupke
2005-01-27#p01 Bayesian Networks for Lossless Dataset Compression, Scott Davies and Andrew Moore
2005-01-27#p02 Probabilistic Logic Programming and Bayesian Networks, Liem Ngo and Peter Haddawy
2005-02-18#p03 Theorems for free!. Philip Wadler
2005-02-19#p01 Recursive types for free!, Philip Wadler
2005-02-22#p01 When is a function a fold or an unfold?, Jeremy Gibbons, Graham Hutton, and Thorsten Altenkirch
2005-02-22#p02 Constructively Characterizing Fold and Unfold, Tjark Weber and James Caldwell
2005-03-03#p01 Representations of First order function types as terminal coalgebras, Thorsten Altenkirch
2005-03-09#p03 Extensional PERs, Peter J. Freyd, P. Mulry, Giuseppe Rosolini, D. Scott
2005-03-09#p04 An introduction to fibrations, topos theory, the effective topos and modest sets, Wesley Phoa
2005-03-10#p04 Scott is not Always Sober. By Peter T. Johnstone, in Continuous lattices, Lecture Notes in Mathematics, 871 (1981), pp. 282--283.
2005-03-15#p02 Parametricty and Mulry's Strong Dinaturality - A. Eppendahl
2005-03-15#p03 Free Theorems in the Presence of seq - P. Johann and J. Voigtländer
2005-03-16#p03 Jan Johannsen's cute title collection
2005-03-21#p01 Linear Logic complements Classical Logic - Vaughan Pratt
2005-03-27#p01 Traced Premonoidal Categories - Nick Benton and Martin Hyland
2005-03-31#p04 Algebraically compact functors - Michael Barr
2005-04-06#p03 Data Structures Considered Harmful - John G. Cleary, Mark Utting, and Roger Clayton
2005-04-14#p03 The SLam Calculus: Programming with Secrecy and Integrity - Nevin Heintze and Jon G. Riecke
2005-04-15#p03 Programming with Static Invariants in Ωmega - Nathan Linger and Tim Sheard
2005-04-30#p01 Premonoidal categories and notions of computation, John Power and Edmund Robinson
2005-05-28#p01 Why Dependent Types Matter. Thorsten Altenkirch, Conor McBride, James McKinna
2005-05-29#p02 Extensional Equality in Intensional Type Theory. Thorsten Altenkirch
2005-05-31#p02 Describing and Reasoning on Web Services using Process Algebra. Gwen Salaün, Lucas Bordeaux, Marco Schaerf
2005-06-04#p02 Qualified Types for MLF by Daan Leijen and Andres Löh
2005-07-02#p04 Backtracking, Interleaving, and Terminating Monad Transformers (Functional Pearl). Oleg Kiselyov, Chung-chieh Shan and Daniel P. Friedman and Amr Sabry
2005-09-17#p01 型理論での形式的証明記述の技法について; 木下佳樹, 高村博紀
2005-09-22#p01 型代入を遅延する最適化型推論アルゴリズム; 上野雄大, 大堀淳
2005-09-23#p01 Agdaプラグイン機構; 池上大介
2005-09-29#p01 Freek Wiedijk. Comparing mathematical provers
2005-10-02#p01 Codata, Thorsten Altenkirch
2005-10-03#p02 Overloading in Agda. Catarina Coquand
2005-10-03#p03 この日記でのスライド等の扱い
2005-10-05#p01 Alpha-Prolog: A Logic Programming Language with Names, Binding, and Alpha-Equivalence; James Cheney, Christian Urban
2005-10-08#p03 Haskellへの多相バリアントの導入について. 香川孝司
2005-10-10#p01 CoInduction in Coq. Yves Bertot
2005-10-11#p01 正規表現とプロセス代数に基づく通信プロトコルコンパイラ. 服部健太, 数馬洋一
2005-10-12#p01 一階様相μ計算. 岡本圭史
2005-10-13#p01 Logic, Higher-order. Dale Miller
2005-10-14#p02 単純型つきλ計算の強正規性の初等的な証明
2005-10-16#p01 Interfaces as games, programs as strategies. Markus Michelbrink
2005-10-27#p03 Partial co-recursive functions, Yves Bertot
2005-10-27#p05 Type Theory with First-Order Data Types and Size-Change Termination, David Wahlstedt
2005-11-22#p02 A Cookbook for the Haskell XML Toolbox with Examples for Processing RDF Documents. Manuel Ohlendorf
2005-12-08#p02 スクリプト言語Rubyの拡張可能な多言語テキスト処理の実装, 松本行弘　縄手雅彦
2006-01-09#p01 Packrat Parsing: Simple, Powerful, Lazy, Linear Time. Bryan Ford
2006-01-10#p01 Proof Methods for Corecursive Programs. Jeremy Gibbons, Graham Huttton.
2006-01-12#p01 Guarded Induction on Final Coalgebras. Duško Pavlović
2006-01-26#p01 Infinite Objects in Type Theory. Thierry Coquand.
2006-01-27#p03 Haskell is not not ML. Ben Rudiak-Gould, Alan Mycroft, and Simon Peyton Jones.
2006-02-05#p01 Pattern matching with dependent types.
2006-03-23#p01 Typed Logical Variables in Haskell. Koen Claessen, Peter Ljunglöf
2006-03-24#p01 The dual of substitution is redecoration. Tarmo Uustalu, Varmo Vene
2006-03-31#p02 Transactional Memory with data invariants. Tim Harris, Simon Peyton Jones
2006-04-24#p01 Haskell on a Shared-Memory Multiprocessor. Tim Harris, Simon Marlow, Simon Peyton Jones
2006-05-03#p02 “ECC, an Extended Calculus of Constructions” by Zhaohui Luo
2006-05-11#p01 Game Semantics. Samson Abramsky and Guy McCusker.
2006-05-14#p01 A groupoid model refutes uniqueness of identity proofs. Martin Hofmann and Thomas Streicher.
2006-05-16#p01 Towards Observational Type Theory. Thorsten Altenkirch and Conor McBride
2006-05-17#p02 モデル検査法のソフトウェア検証への応用. 中島震
2006-05-21#p03 Representing Nested Inductive Types using W-types
2006-06-10#p03 Fast and loose reasoning is morally correct. Nils Anders Danielsson, Jeremy Gibbons, John Hughes and Patrik Jansson.
2006-06-24#p01 Functional pearl: i am not a number -- i am a free variable. Conor McBride, James McKinna
2006-07-17#p02 Learning Minesweeper with Multirelational Learning. Lourdes Peña Castillo, Stefan Wrobel
2006-09-08#p01 MapReduce: Simplified Data Processing on Large Clusters. Jeffrey Dean and Sanjay Ghemawat
2006-09-10#p01 Comonadic Functional Attribute Evaluation. Tarmo Uustalu and Varmo Vene.
2006-09-26#p02 Build, Augment and Destroy, Universally. Neil Ghani, Tarmo Uustalu, and Varmo Vene
2006-10-05#p02 Folds, Church Encodings, Builds, and Short Cut Fusion for Nested Types: A Principled Approach by Neil Ghani and Patricia Johann
2006-10-06#p01 Representing Cyclic Structures as Nested Datatypes by Makoto Hamana (浜名誠), Neil Ghani, Tarmo Uustalu and Varmo Vene
2006-10-08#p01 Arrows, like Monads, are Monoids by Chris Heunen and Bart Jacobs
2006-10-11#p01 A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Preliminary Report) by P. N. Benton
2006-10-13#p03 Parametricty and Mulry's Strong Dinaturality by A. Eppendahl
2006-10-27#p01 Categorical Semantics of Linear Logic For All by Valeria de Paiva
2006-11-08#p02 Programs, grammars and arguments: a personal view of some connections between computation, language and logic by J. Lambek
2006-11-09#p02 The Theory of Parametricity in Lambda Cube by 竹内泉
2006-11-10#p01 A note on inconsistencies caused by fixpoints in a cartesian closed category by H. Huwig and A. Poigné
2006-11-27#p03 Reading Notes: Why is Cpo Cocomplete? by Jean Goubault-Larrecq
2006-11-28#p01 Agate—an Agda-to-Haskell compiler by Hiroyuki Ozaki, Makoto Takeyama and Yoshiki Kinoshita
2006-12-07#p01 Applicative Programming with Effects by Conor McBride and Ross Paterson
2006-12-11#p01 Shortcut fusion is correct by Patricia Johann
2006-12-14#p01 Domain Theoretic Models Of Polymorphism by Thierry Coquand and Carl A. Gunter
2006-12-16#p01 Deriving Structural Hylomorphisms From Recursive Definitions by Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi
2007-01-17#p03 Lightweight Fusion by Fixed Point Promotion. by Atsushi Ohori and Isao Sasano
2007-03-07#p02 ⊤⊤-closed relations and admissibility by Martín Abadi
2007-04-15#p01 Trampolined Style by Steven E. Ganz, Daniel P. Friedman and Mitchell Wand
2007-05-19#p02 “Combining Events And Threads For Scalable Network Services ― Implementation And Evaluation Of Monadic, Application-level Concurrency Primitives”, by Peng Li and Steve Zdancewic
2007-06-22#p01 “Coroutines in Lua” by Ana Lúcia de Moura, Noemi Rodriguez and Roberto Ierusalimschy
2007-07-02#p01 “A formulae-as-types interpretation of Subtractive Logic” by Tristan Crolard
2007-07-25#p01 “Ropes: an Alternative to Strings” by Hans-J. Boehm, Russ Atkinson and Michael Plass
2007-07-29#p02 “Finger Trees: A Simple General-purpose Data Structure” by Ralf Hinze and Ross Paterson
2007-10-19#p01 “Algebraic laws for nondeterminism and concurrency” by Matthew Hennessy and Robin Milner
2007-10-30#p01 “Faster laziness using dynamic pointer tagging” by Simon Marlow, Alexey Rodriguez Yakushev, Simon Peyton Jones
2007-11-02#p02 “Metamorphic Programming Extension to Haskell” by Martin Erwig
2007-11-04#p02 “Program-ing Finger Trees in Coq” by Matthieu Sozeau
2007-11-06#p01 “State of the Union: Type Inference via Craig Interpolation” by Ranjit Jhala, Rupak Majumdar and Ru-Gang Xu
2007-11-16#p01 “Why it's nice to be quoted: quasiquoting for haskell” by Geoffrey Mainland
2007-11-27#p02 “Context Threading: A flexible and efficient dispatch technique for virtual machine interpreters” by Marc Berndl, Benjamin Vitale, Mathew Zaleski and Angela Demke Brown
2007-12-02#p04 “A simple propositional S5 tableau system” by Melvin Fitting
2007-12-17#p01 “Mechanizing common knowledge logic using COQ” by Pierre Lescanne
2008-01-14#p01 “Foundations for structured programming with GADTs” by Patricia Johann and Neil Ghani
2008-01-28#p01 ProLogICA: a practical system for Abductive Logic Programming by Oliver Ray and Antonis Kakas
2008-01-30#p01 MinCamlコンパイラ by 住井英二郎
2008-02-07#p02 正規表現における非包含オペレータの提案 by 田中哲
2008-02-14#p01 “Towards open type functions for Haskell” by Tom Schrijvers, Martin Sulzmann, Simon Peyton Jones, and Manuel Chakravarty
2008-02-21#p01 “Three Partition Refinement Algorithms” by Robert Paige and Robert Tarjan
2008-02-28#p01 “Lest We Remember: Cold Boot Attacks on Encryption Keys” by J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, and Edward W. Felten
2008-03-13#p01 “Continuations in Natural Language” by Chris Barker
2008-03-18#p01 “Category Theoretical Semantics for Pregroup Grammars” by Anne Preller
2008-03-21#p02 書き換え系について少し勉強 (「潜在帰納法と書き換え帰納法の比較」 by 小池広高 and 外山芳人)
2008-04-05#p02 “Polymorphic Delimited Continuations” by Kenichi Asai, Yukiyoshi Kameyama
2008-04-06#p01 記号モデル検査の並行ソフトウェアシステムへの応用について by 土屋達弘
2008-04-08#p01 “Co-limits in topoi” by Robert Paré
2008-04-19#p01 "Scott is not always sober” by Peter T. Johnstone
2008-04-22#p01 “The Essense of the Iterator Pattern” by Jeremy Gibbons and Bruno C. d. S. Oliveira
2008-04-24#p01 “The Path Category in ALF and AGDA” by Ilya Beylin
2008-04-27#p01 “Checking Race Freedom via Linear Programming” by Tachio Terauchi
2008-05-12#p01 『Cygwinで日本語TeX』 by 黒木裕介
2008-05-14#p01 多相レコード型に基づくRubyプログラムの型推論 by 松本宗太郎 and 南出靖彦
2008-05-24#p01 “Optimistic evaluation: an adaptive evaluation strategy for non-strict programs” by Robert Ennals and Simon Peyton Jones
2008-06-06#p01 計算と論理のための自然枠組NF/CAL by 佐藤雅彦
2008-06-08#p01 “A constructive proof of equivalence of formalism od DCG's with the formalism of type 0 phrase-structure grammars” by Marica D. Prešić and Slavisa B. Prešić
2008-06-30#p01 “A functional quantum programming language” by Thorsten Altenkirch and Jonathan Grattage
2008-07-05#p01 Morph Endo!: Report on the Tenth Interstellar Contest on Fuun Programming
2008-08-27#p01 “Program Generation in the Equivalent Transformation Computation Model Using the Squeeze Method” by Kiyoshi Akama, Ekawit Nantajeewarawat, and Hidekatsu Koike
2008-09-06#p01 “Models of LCF” by Robin Milner
2008-09-08#p01 “Lightweight Monadic Regions” by Oleg Kiselyov and Chung-chieh Shan
2008-09-10#p02 ソフトウェア仕様の差分について by 石井忠夫
2008-09-13#p01 手続き型プログラムから書換え系への変換に基づくソフトウェア検証の試み
2008-09-17#p02 Analyzing Websites for User-Visible Security Design Flaws
2008-09-19#p01 The Transactional Memory / Garbage Collection Analogy
2008-09-21#p01 Sets in types, types in sets
2008-09-28#p01 A Study in the Foundations of Programming Methodology: Specifications, Institutions, Charters and Parchments
2008-10-09#p01 “&” by Christopher J. Mulvey
2008-10-11#p01 Derivatives of Regular Expressions by Janusz Brzozowski
2008-10-14#p01 SmallCheck and Lazy SmallCheck: automatic exhaustive testing for small values
2008-11-13#p01 “Functorial Semantics of Algebraic Theories” by F. William Lawvere
2008-11-15#p01 “Seven trees in one” by Andreas Blass
2008-12-20#p02 Universal Shell Programming（USP）向けシェル機能と実装 by 片山善夫 and 當仲寛哲
2008-12-23#p01 “Perils of Transitive Trust in the Domain Name System” by Venugopalan Ramasubramanian and Emin Gün Sirer
2008-12-31#p01 「クリーニ代数入門」 by 古澤仁 and 高井利憲
2009-01-06#p01 “Much Ado about Two: A Pearl on Parallel Prefix Computation” by Janis Voigtländer
2009-01-07#p02 “The Thermodynamics of Computation — a Review” by Charles H Bennett
2009-05-04#p02 "Do we Need Dependent Types?" by Daniel Fridlender, Mia Indrika
2009-06-11#p01 スコーレムの有限主義 by 出口康夫
2009-06-13#p01 “Data types á la carte” by Wouter Swierstra
2009-06-22#p01 “Parsing Expression Grammars: A Recognition-Based Syntactic Foundation” by Bryan Ford
2009-06-23#p01 Σモノイド—メタ変数と明示的環境を持つ高階構文 by 浜名誠
2009-07-05#p01 “Referential transparency, definiteness and unfoldability” by Harald Søndergaard and Peter Sestoft
2009-07-07#p01 “Types are calling convensions” by Max Bolingbroke and Simon Peyton Jones
2009-07-11#p01 “100 years of Zermelo's axiom of choice: what was the problem with it?” by Per Martin-Löf
2009-07-15#p01 “Observational equality, now!” by Thorsten Altenkirch, Conor Mcbride, Wouter Swierstra
2009-07-17#p02 “Equality and hashing for (almost) free: Generating implementations from abstraction functions” by Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph P. Near, Aleksandar Milicevic, Daniel Jackson
2009-07-30#p01 “Ricsin: Ruby にCを埋め込むシステム”笹田耕一
2009-08-08#p01 “New Techniques that Improve MACE-style Finite Model Finding” by Koen Claessen and Niklas Sörensson
2009-08-13#p01 “The IDP framework for declarative problem solving” by Maarten Mariën, Johan Wittocx, and Marc Denecker
2009-09-18#p01 “First-Order Logic as a Lightweight Software Specification Language - The ETPTP Toolkit” by Michel Rijnders
2009-11-07#p01 “A semantics for imprecise exceptions” by Simon Peyton Jones, Alastair Reid, Tony Hoare, Simon Marlow and Fergus Henderson
2009-11-08#p01 “Asynchronous Exceptions in Haskell” Simon Marlow, Simon Peyton Jones, Andrew Moran and John Reppy
2009-11-10#p01 “The Physical World as a Virtual Reality” by Brian Whitworth
2010-01-25#p01 “Runtime support for multicore Haskell” by Simon Marlow, Simon P. Jones, Satnam Singh
2010-01-27#p01 “Stream fusion: from lists to streams to nothing at all” by Duncan Coutts, Roman Leshchinskiy, Don Stewart
2011-08-25#p01 "The Arrow Calculus" by Sam Lindley, Philip Wadler, Jeremy Yallop
2011-08-26#p01 “The worker/wrapper transformation” by Andy Gill and Graham Hutton