Gallery
This portfolio presents selected materials from my work on information systems and proof systems. These include interfaces for temporal information, computational architectures, formal modelling, automated deductions, and proof visualizations. Together, these materials illustrate the relationship between the theoretical foundations of these systems and their implementation as working software.
View full sizeTimesort tagline lockup
View full sizeStandardization of information via formal derivation
View full sizeProof system: typing and reduction
Input: fst [(((lam x -> lam y -> lam z -> x * y + z) 6) 7) 8, "PS"]
View full sizeInformation system: frame transition
View full sizeInformation system: related-instance retrieval
View full sizeProof system: linear sequent derivation
Input: |- ((A plus B) tensor ((A lolli C) with (B lolli D))) lolli (C plus D)
View full sizeProof system: ordered sequent derivation
Input: ordered: ((A fuse B) with (A fuse C)), (B under D) derives (A fuse D) plus (A fuse D)
View full sizeTerms of Service contents
View full sizeFormal derivation of temporal information
View full sizeProof system: typing and reduction in a narrow environment
Input: fst [(((lam x -o lam y -o lam z -o x * y + z) 6) 7) 8, "PS"]
View full sizeUpload temporal information
View full sizeAlphabetized schedule tables
View full sizeWeighted search results
View full sizeQuadruple frame-stack structure
View full sizeProof system: derivation of a first-order linear sequent
Input: |- forall x(P(x) lolli Q(x)) lolli ((forall x Q(x) lolli R) lolli (forall x P(x) lolli R))
View full sizeProof system: reductions for simple bitwise expression
Input: bitwise: 00000111 + 00001100 XOR 10101010
View full sizeProof system: simple derivation of a propositional formula
Input: (A -> C) -> ((B -> C) -> ((A | B) -> C))
View full sizeProof system: low- and high-level bitwise reductions, positioned left
Input: bitwise: 00011110 * 00000111 XOR 10101010
View full sizeProof system: low- and high-level bitwise reductions, positioned right
Input: bitwise: 00011110 * 00000111 XOR 10101010
View full sizeProof system: derivation of simple modal formula
Input: box (A ^ B) -> (box A ^ box B)
View full sizeProof system: nested λ-function
Input: [((lam x -> lam y -> map (lam s -> s ^ ".") [x, y]) "fst") "snd", true]
View full sizeAdvertising order confirmation
View full sizeContextual action sheet
View full sizeTimetable with video controls
View full sizeTransition to lazy timetables
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full sizeA standardized presentation of temporal information is presented
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size
View full size