for the few of us.

Research Blog of 穆信成 Shin-Cheng Mu

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

• On building trees with minimum height, relationally »
• « Optimisation problems in logic programming: an algebraic approach

• Search

• Recent Comments

  • Shin on An Unsuccessful Attempt to Compute the Intersection of Regular Expressions
  • Martin Sulzmann on An Unsuccessful Attempt to Compute the Intersection of Regular Expressions
  • Shin on Well-Founded Recursion and Accessibility
  • Shin on S Combinator is Injective, with Proofs
  • Oleg on Well-Founded Recursion and Accessibility

• 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

  • “General Recursion using Coinductive Monad” Got Right
  • General Recursion using Coindutive Monad
  • Typed λ Calculus Interpreter in Agda
  • Tail-Recursive, Linear-Time Fibonacci
  • Algebra of programming using dependent types

• Meta

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

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

• Basic2Col
• WordPress