recent posts | Lambda the Ultimate

recent posts

type	title	author	last post
Story	Topology in Programming Language Semantics	Jacques Carette	2006-09-03 14:13
Forum topic	Total functional language self interpreter? Something very similar to by Matt M The Concept of Termination in Functional Languages by Charles Stewart Uninhabited types by Andris Birkmanis Which example? by Matt M Which example? by Matthieu Sozeau Be careful again by Matt M Church-Turing, GÃ¶del and Curry-Howard by Felicia Li Svilling Approximation by Brandon Moore Question by marco Picking nitpicknits by Charles Stewart ...	jason stumpf	2009-06-27 13:57
Forum topic	Total Functional Programming Not sure about the fib definition by Jasonw Programs in Coq by Brandon Moore Nothing's wrong with Coq (excepting for its popularity...) by Gavin Mendel-Gleason The original paper by Moggi... by neelk This idea was often by Derek Elkins Partial functions are types by Scott Johnson Non-turing completeness by svembu no kidding by jimdesu What's wrong with Coq by nwhitehe And don't forget currency by Chris Rathman ...	Greg Buchholz	2007-05-27 20:18
Forum topic	Total Self Compiler via Superstitious Logics The latest I've found in the by naasking Self-evaluation by naasking At one point, you say "I by Matt M Ah, terminating only in practice, not in theory :) by Ross Angle Just to be clear, I'm not by Matt M Number lazy buggy bumpers by Ross Angle Another try by Matt M Self-weakening quine by Ross Angle How would you express this by Matt M How would you express this by Ross Angle ...	Matt M	2013-09-03 06:14
Forum topic	Toward a better programming The victorious, bloodthirsty by Kay Schluehr Indeed by Keean Schupke See above by Keean Schupke but but but by raould Useful Coupling of Concerns by dmbarbour Abstraction, Modularity, Composition by Ted Kaminski I don't think it will ever be easy. by Keean Schupke i'm sorry zaphod i don't believe a word of it by raould free epiphaies on ltu by raould A search for foundations by Kalani ...	ibdknox	2014-04-01 05:35
Story	Towards a Mechanized Metatheory of Standard ML	neelk	2007-04-04 18:22
Story	Towards Applicative Relational Programming declarative by Sean McDirmid What about list comprehensions? by shapr Higher-order Logic Programming in Prolog by Greg Buchholz Yes, using map/fold/unfold by Sean McDirmid Higher-order unification is undecidable by neelk I am not sure what you mean by Andris Birkmanis I'm not sure what they mean by Sean McDirmid Higher Order (in the functional programming sense) by Gavin Mendel-Gleason Fixed by Charles Stewart Wrong link? by Sjoerd Visscher	Charles Stewart	2006-03-30 15:46
Story	Towards efficient, typed LR parsers which major ML implementations support GADTs? by Burak Emir Cool! by neelk That paper just blew my mind by Josef Svenningsson Derivation of a Typed Functional LR Parser by Derek Elkins	neelk	2007-05-07 11:09
Forum topic	Towards general nested data parallelism These approaches look fairly by lmeyerov I, actually, once suggested that. by Serguey Zefirov	lmeyerov	2010-08-03 14:01
Forum topic	Towards Hard Real-Time Erlang You don't necessarily need by pkhuong You don't need mutation to create cycles by Matt M Reference counting by Thomas Munro I promoted it to the home by Ehud Lamm I'm honored by James Iry Great by Ehud Lamm Oops by James Iry Sure by James Iry The answer is in the paper by renox Time to become a by Ehud Lamm	James Iry	2008-08-28 17:28
first page previous page next page last page