[ Content | View menu ]

for the few of us.

Research Blog of 穆信成 Shin-Cheng Mu

• Home
• About
• Blog
• Publications
• Software
• Links

Monthly Archive May, 2008

• Search

• Recent Comments

  • Shin on Tail-Recursive, Linear-Time Fibonacci
  • Daniel on Tail-Recursive, Linear-Time Fibonacci
  • Shin on Agda Exercise: Proving that Mergesort Returns Ordered Lists
  • newsh on Agda Exercise: Proving that Mergesort Returns Ordered Lists
  • Dave on Deriving a Virtual Machine

• Tags

  λ calculus Agda Bidirectional Updating Burrows-Wheeler Transform Concurrency Converse-of-a-Function Theorem Curry-Howard Data Structure Dependent Type Fibonacci GADT Greedy Theorem Haskell HaXML List Homomorphism Logic Logic Programming Program Derivation Program Inversion Quantum Programming Quine Regular Expression Segment Problems Termination Thinning Theorem Types XML Streaming

• Recent Posts

  • Tail-Recursive, Linear-Time Fibonacci
  • Algebra of programming using dependent types
  • A programmable editor for developing structured documents based on bidirectional transformations
  • A Simple Exercise using the Modular Law
  • Well-Foundedness and Reductivity

• Meta

  • Log in
  • Entries RSS
  • Comments RSS
  • WordPress.org

• Content © for the few of us. 2008
• xhtml 1.0
• css 2
• Top

• Basic2Col
• WordPress