The Problem with "dup" and "swap" in Stack-Based Languages | Lambda the Ultimate
Operations like "dup" and "swap" in stack-based languages are special in that they return multiple results (unlike most other languages which simulate multiple results by returning tuples). I find expressing the concept in a type system challenging (if anyone else has done it successfully I would definitely like to hear about it). One of the core problems is that the type of a function like eval,
Beginning Factor – Shufflers & Combinators
In the previous installment of Beginning Factor, we discussed some of the attributes of stack-based languages and the syntax for defining words in Factor. This time around, I’d like to introduce stack shufflers, quotations & combinators, and touch on some more basic data types and their properties. Up until now, we’ve essentially been using Factor as an overqualified RPN calculator. I just wanted
Eggs Unlimited - stacktor
Version 0.8 Release fix 0.7 Meta-file fix 0.6 Documentation fix 0.5 Initial release Documentation Stacktor allows programmers to use stack based programming next to more familiar styles of programming such as functional, imperative, object-oriented, etc. In stack programming, arguments are taken from the stack, and return values are pushed back on to the stack. Literal values are automatically pus
Modern Forth
Modern Forth By Stephen Pelc, September 11, 2008 Modern Forth systems are not like their ancestors Stephen Pelc is managing director of MicroProcessor Engineering Ltd. He can be contacted at www.mpeforth.com Engineering is the art of making what you want from things you can get. --Jerry Avins I am a design chauvinist. I believe that good design is magical and not to be lightly tinkered with. The d
New mark-compact algorithms
It'd be good for a garbage collector to have low space overhead, good cache behavior and low fragmentation. Low space overhead is useful wherever there's a limited amount of RAM. Eliminating fragmentation is important, since fragmentation reduces the usable amount of memory and can make allocation slower. Improving cache behavior of ordinary programs is always good for performance, and surprisingl
Playing with monad transformers
Yesterday someone posted a link to a great monad transformers tutorial. It's incredible. I think I finally start to understand (or at least being able to use) it. As part of testing my fresh knowledge I've written a simple virtual machine for a Forth-like language. Code (as usual - Literate Haskell, so you can just put it into .lhs file and run it) below. Enjoy! > module Main where > > import Cont
Starting FORTH
Starting FORTH has been the classic Forth tutorial and textbook since its first release. Many experienced programmers have commented on its concise utility and completeness. Beginners will find a carefully planned introduction to the Forth programming language that will prepare them for other books like Forth Application Techniques and Forth Programmer’s Handbook. FORTH, Inc. and the book’s author
Levels of code in Forth programing
Levels of code in Forth programming I had been programming in Fortran and assembler for a number of years when I got my first personal computer. It was exciting. On the first generation PC one had to toggle in a paper tape loader from front panel switches, byte by byte, then start the paper tape reader and then one could output to the led on the front panel. I had waited for the first model that b
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
What is special about combinators in Joy
http://www.codecommit.com/blog/cat/the-joy-of-concatenative-languages-part-3
Packet Forth
Forth Versus C
Parsing JavaScript with Factor
Over the Shoulder 1: Text Preprocessing in Forth - Samuel's All-New New News News Page
Forth Foundation Library - Welcome
http://sarnold.free.fr/pub/sept/sept.html
Beginners Guide to Forth
Forth: An underview
Forthfreak wiki
moiの頭の中 - Forthを作ってみる