Skip to content

niche computing science

  • Publications
  • Research Blog
  • Teaching
  • Search

On building trees with minimum height, relationally

June 20, 2007 February 13, 2010 / Converse-of-a-Function Theorem, Optimisation Problems, Program Derivation, Program Inversion

S-C. Mu and R. S. Bird, On building trees with minimum height, relationally. In First Asian Workshop on Programming Languages and Systems, Singapore, December 2000.
[GZipped Postscript]

Algebraic Methods for Optimisation Problems (Transfering dissertation)

June 20, 2007 February 13, 2010 / Converse-of-a-Function Theorem, Greedy Theorem, Optimisation Problems, Program Derivation, Thinning Theorem

S-C. Mu, Algebraic Methods for Optimisation Problems. Transfering dissertation.

Optimisation problems in logic programming: an algebraic approach

June 20, 2007 February 13, 2010 / Greedy Theorem, Logic Programming, Optimisation Problems, Thinning Theorem

S. Seres and S-C. Mu, Optimisation problems in logic programming: an algebraic approach. In Proceedings of LPSE’00, July 2000.
[GZipped Postscript]

Out-of-core functional programming with type-based primitives

June 20, 2007 December 7, 2007 / Data Structure

T-R. Chuang and S-C. Mu, Out-of-core functional programming with type-based primitives. In 2nd International Workshop on Practical Aspects of Declarative Languages, January 2000.
[GZipped Postscript]

A Haskell Quine

June 19, 2007 November 27, 2007 / Haskell, Quine

A Haskell quine. That is, a program whose output is itself.

Countdown

June 19, 2007 February 13, 2010 / Optimisation Problems, Program Derivation, Program Inversion

Programs and profiling results accompanying the paper Countdown: a case study in origami programming. [GZipped Tarball]

Inv

June 19, 2007 November 27, 2007 / Bidirectional Updating, Program Inversion

The injective language Inv, together with the language X, the XEditor, and the HaXml embedding. [GZipped Tarball]

S Combinator is Injective

June 19, 2007 December 5, 2007 / λ calculus

Do you know that the S combinator is injective? I have a simple algebraic proof and Nakano actually constructed its inverse.

Posts navigation
← Previous Page 1 … 9 10
中文訪客請參觀小眾計算學!

Research

Adjoint Functors Adjunction Agda Approximation Backtracking Bidirectional Updating Burrows-Wheeler Transform Concurrency Converse-of-a-Function Theorem Curry-Howard Data Structure Dependent Type Effect Fibonacci GADT Galois Connection Generic Datatype Greedy Theorem Haskell HaXML Imperative Programs Indirect Equality Inductive Proof List Homomorphism Logic Logic Programming Monad n-Queens Non-determinism Optimisation Problems Partitioning Problems Program Derivation Program Inversion Quantum Programming Quicksort Quine Regular Expression Relation Segment Problems State Termination Thinning Theorem Types XML Streaming λ calculus

Recent Comments

  • Zack on Declarative pearl: deriving monadic quicksort
  • 最大信用問題 — 一個區段問題的例子 – 小眾計算學 on The Maximum Segment Sum Problem: Its Origin, and a Derivation
  • Shin on Evaluating Simple Polynomials
  • Ben Franksen on Evaluating Simple Polynomials
  • 程式推導範例:快速排序 (Quicksort)與快速選擇 (Quickselect) | on The Maximum Segment Sum Problem: Its Origin, and a Derivation
Copyright © 2023 niche computing science | Powered by Astra WordPress Theme