Lambda the Ultimate

e.g.

http://lambda-the-ultimate.org/node/3129

shows up as like 2x wide in my firefox (on a mac).

Here is an outline of a new lisp I plan on creating. Its a fusion of current PLT theories which takes a SchemI am deconstructing lisp and finding what is really meant in lisp and reconstructing it utilizing category theory and logical programming. Scheme is still used for all computation. Its a strongly typed scheme with type inference signature are used to type the language. Categories become your way to create new data types. Your base data type is a topos or basically a type of set from set theory. A set os a collection of things. Lisp is used as the primary syntax so it is a lisp like system. Graphs are also a base data type so the things you do in lisp can be generalized so basically you can code in lisp but it would be weakly typed. The language borries alot from haskell in its design and scheme in its philosophy and design.

By reconstructing I mean actually taking axioms of lisp and retooling them into logic and category theories. Lisp becomes something different and instead a subset of the language. Lisp will be fully expressable as a turing complete language but there will be other paradigms in the language.

Functional programming is still a part of lisp. We also add monads to represent computation. Category theory is based upon morphism and we apply this as morphisms on HOFs. The base data types are graphs and topos. Since all other data types will be defined in this manner we have a interconnection between functional data structures and categorial. Sort of a fusion of scheme and haskell.

The virtual machine is my own design which is also based upon an upcoming arxiv paper. The first step is to get it working on that register machine. The special part of this register machine is that it is intended to work as a hypercomputer although if that fails it still is easy to implement parallelism due to its matrix based design. for more information.

The kali scheme system will be ported to scheme48 1.3 and used for parallelism. It was a abandoned research project at NEC but it was still functional. This would be a subproject of the total project.

Here is how an example program looks


(define-functor (fact-functor sub1) => (fact)
(define (fact n)
(if ( one
(* n (fact (sub1 n))))))
(define-morphism fact-functor N$)
;;N is the set of natural numbers
;;


Join me in #categorizer on freenode.net or zitterbewegung@gmail.com on gtalk/email if you want to discuss ---- Further reading

Category theory from haskell wiki http://www.haskell.org/haskellwiki/Category_theory

A proposal for a Galois Machine See http://arxiv.org/abs/0812.4009 also http://www.reddit.com/r/math/comments/7nh74/ask_mathithelp_this_is_my_first_paper_in/

Charity papers on cat theory ftp://ftp.cpsc.ucalgary.ca/pub/projects/charity/literature/papers_and_reports/dataII.ps

Github source repository for implementation

http://github.com/zitterbewegung/categorizer/tree/master

Kali Scheme Revival

http://community.schemewiki.org/kali-scheme/

I was planning on asking for peoples comments about a parser generator I recently made. Is that appropriate for LtU?

MLstate - currently in stealth mode - is an IT company, whose functional programming approach to SaaS and cloud computing has been recently recognized by the French Ministry of Research Innovation Award and support from leading investors.

We are research-oriented, we value technical excellence and innovation and we believe our technology has a potential to dramatically change the way web applications are being built.

MLstate opens several new permanent positions to meet this challenge:

• Senior Developers: Outstanding PhDs with at least 3 years of research experience in functional languages and/or formal verification and the ability to manage a small technical team.
• Developers: PhDs with strong FP skills. Applications from PhD students defending their thesis soon are also welcome.

Jobs are based in Paris and include a competitive compensation package.

Please send a (link to your) CV to julien.sylvestre@mlstate.com

[spam content deleted by admin]

Ian Clarke presents the prototype for Swarm -a distributed stack based programming language to be written in Scala. The fundamental concept behind Swarm is that we should "move the computation, not the data".

Hi, in short I suggest adding generic link-tags to the html for better generic navigation. That is, at least rel="prev" and "next" (I'd add "top", "first" and "last" even if they are not(?) w3c recommended).

I already wrote a mail, but may not have made myself very clear, so to elaborate on that:

The benefit of adding this information comes when using some kind of plugin or support from browsers (Links has some, Firefox with plugin) so that "forward one thread" and so on works with just one keystroke instead of mouse navigation. Since the information is already there, adding it would be rather easy or so I think.

Now, maybe someone likes this enhancement as well. And since this is my first post here, hello :)

When one previews a comment, the previewed comment has a live "reply" link, to the same URL as used to compose the post now being previewed.

This is somewhat obscure, but potentially confusing behaviour: the "reply" link should, I think, not be live.

Drupal bug/misfeature?

I'd appreciate if somebody could guide to where I can download the PUSH programming language. The only place I found was SourceForge.net and the link doesn't open.

This probably isn't a critical bug, but just for the record, I stumbled across this behavior while writing a post. Fortunately I caught my mistake and fixed it quickly. See my comments for details.