factor-language.blogspot.com

hi-language.blogspot.com

Hi Language: May 2012

http://hi-language.blogspot.com/2012_05_01_archive.html

A series of notes on a language under development. Wednesday, May 9, 2012. I went back to my original compiler, and I was actually surprised at how good it is. At least, in theory, not in practice. There are a number of simple mistakes in the source, which are mostly attributable to writers block. Maddening really, stuck in the Turing tarpit. Tuesday, May 1, 2012. I've been looking at recent implementation of the Kernel language, a Lisp derivative, hoping to find better scanner support. The good new,...

evincarofautumn.blogspot.com

The Big Mud Puddle: 02/01/2012 - 03/01/2012

http://evincarofautumn.blogspot.com/2012_02_01_archive.html

The Big Mud Puddle. Jon Purdy writes blarticles on computing, language, and design. Why Concatenative Programming Matters. There doesn’t seem to be a good tutorial out there for concatenative programming, so I figured I’d write one, inspired by the classic “Why Functional Programming Matters” by John Hughes. With any luck it will get more people interested in the topic, and give me a URL to hand people when they ask what the heck I’m so excited about. By Norman Ramsey even goes so far as to say:. That&#8...

hi-language.blogspot.com

Hi Language: July 2012

http://hi-language.blogspot.com/2012_07_01_archive.html

A series of notes on a language under development. Tuesday, July 31, 2012. I came across Elalang. On LtU, which apart from meaning Hi language in Greek, has a lot more in common with my language than I thought. The language is a strict, sometimes lazy, dynamic variant of ML or Haskell. It runs on .Net by compiling to bytecode for the CLI. So I guess I should stop mucking about and just implement a version of that; mind you, not even that is trivial.). Sunday, July 29, 2012. Functional Secrets at Intel.

hi-language.blogspot.com

Hi Language: April 2011

http://hi-language.blogspot.com/2011_04_01_archive.html

A series of notes on a language under development. Saturday, April 30, 2011. I removed the embedding functions and introduced a native keyword into the compiler. Now, like in most other languages, external definitions are just given, for example, such: native inc: int - int. Ie, the name and type are given but the body isn't. I now need to build a new runtime which makes use of this. Monday, April 25, 2011. So long, C. Don't generalize mutable type unknowns. Sunday, April 24, 2011. And decided against it.

hi-language.blogspot.com

Hi Language: July 2011

http://hi-language.blogspot.com/2011_07_01_archive.html

A series of notes on a language under development. Wednesday, July 20, 2011. Sometimes it helps to bounce ideas against other people, so thanks to LtU/MattM for getting something right. I hacked together a solution once to deal with the translation of exceptions, try/catch and throw blocks. I looked a bit at shift/reset, found it too difficult to implement, and tried to implement something more trivial with two combinators. 1 R ( s - 1 s 3) = 1 ( s - 1 s 3) S = 1 (1 S 3) = 1 3 = 4. It works, but it also ...

hi-language.blogspot.com

Hi Language: June 2015

http://hi-language.blogspot.com/2015_06_01_archive.html

A series of notes on a language under development. Wednesday, June 24, 2015. I like the prover in my bootstrap but, yeah, there's algorithm W too. So, I decided to go for that. Gone are the bisimulation proofs of type equivalences but I simply don't know what I am dropping there and can't care to figure it out. At least with W I know it has been proven correct, terminates, and gives reasonable performance on small terms. So How hard can it be? Sunday, June 21, 2015. The type checker I now have "records" ...

hi-language.blogspot.com

Hi Language: Classes, Monads, and Implicits

http://hi-language.blogspot.com/2015/06/classes-monads-and-implicits.html

A series of notes on a language under development. Thursday, June 4, 2015. Classes, Monads, and Implicits. Since I am programming in C my transforms/rewrites are implemented as classes which often have a simple local state. I subsequently wrap these classes into 'pure' simple AST manipulating functions which construct an object of the class, applies the rewrite, and returns the rewritten AST. It works surprisingly well, even though it feels somewhat 'muddy' relying on all kinds of invariants. The idea wo...

hi-language.blogspot.com

Hi Language: December 2010

http://hi-language.blogspot.com/2010_12_01_archive.html

A series of notes on a language under development. Monday, December 27, 2010. I use a simple 'push-enter' method where the callee determines, given the arity of the combinator and the number of arguments passed, how to rewrite a closure. Most optimizing functional compilers do arity-analysis and use an 'eval-apply' compilation scheme where the caller generates the code for the arity known at compile-time. Wednesday, December 22, 2010. What are Type Classes? One of the reasons Hi has simple interfaces on ...

hi-language.blogspot.com

Hi Language: Algorithm W

http://hi-language.blogspot.com/2015/06/algorithm-w.html

A series of notes on a language under development. Wednesday, June 24, 2015. I like the prover in my bootstrap but, yeah, there's algorithm W too. So, I decided to go for that. Gone are the bisimulation proofs of type equivalences but I simply don't know what I am dropping there and can't care to figure it out. At least with W I know it has been proven correct, terminates, and gives reasonable performance on small terms. So How hard can it be? Subscribe to: Post Comments (Atom). Log 061815 - B.