SSE2634 (7/27/2012 2:20:26 PM) comp.lang.forth I had a fresh look at SSE2. Strangely, my tests fail to show up any
performance difference with the good ol' FPU.
The test I did is based on an SSE2 DDOT implementation (DDOT_sse2, vector
multiplication).... mhx
Quotations revisited11041 (7/14/2012 1:54:37 PM) comp.lang.forth Recently, the subject of quotations popped up again and I remembered
an unfinished project.
It proves that in iForth (a simple form of) quotations takes only three
lines of code. The main limitation is t... mhx
Auotations revisited130 (7/14/2012 1:47:18 PM) comp.lang.forth Recently, the subject of quotations popped up again and I remembered
an unfinished project.
It proves that in iForth (a simple form of) quotations takes only three
lines of code. The main limitation is t... mhx
World's toughest sudoku puzzle1545 (7/4/2012 6:15:36 PM) comp.lang.forth Bullshit detector going off with a bang ...
"A Finnish PhD in mathematics, Arto Inkala, has allegedly created the world's
toughest sudoku puzzle. 'There's no straightforward way to define the difficulty
... mhx
evplace (eigenvalue placement)236 (6/4/2012 6:47:47 PM) comp.lang.forth I wanted to compute a state-feedback matrix K such that
the eigenvalues of Phi-Gamma*K are those specified in a vector P.
Phi and Gamma are defined as dx/dt = Phi*x + Gamma*u, with x the state
variables an... mhx
Sum of squares1839 (3/26/2012 6:50:25 PM) comp.lang.forth Admit it (when trying it yourself), this exercise is surprisingly tricky. -marcel -- ------------------------------------------- (* * LANGUAGE : ANS Forth with extensions * PROJECT : Forth Environm... mhx
Sparse sets243 (3/26/2012 6:49:13 PM) comp.lang.forth I have a hard time believing the quoted advantages of sparse sets myself, but it is a nice exercise where one can drop in a small Forth twist. I like the code a lot better than what can be found for other la... mhx
Perfect Square puzzle0101 (3/25/2012 8:53:25 PM) comp.lang.forth This is Perfect Square puzzle from the New Scientist. Quite nice and short solutions exist in other languages. Why not in Forth? FORTH> in samefivedigits.frt Creating --- Same Five Digits Version 0.01 ---... mhx
Special Squares436 (3/24/2012 10:25:07 PM) comp.lang.forth Another puzzle in the vein of sumbrero. Although a brute-force solution may be possible, cutting impossible branches is more fun. Is there an 18-digit whole number x, such that the last 18 digits of x^2 are ... mhx
Set with unique members141 (3/20/2012 6:24:21 PM) comp.lang.forth This is ugly code from sumbrero: : single2? ( a b -- bool ) = ; : single3? ( a b c -- bool ) 2DUP = >R 2 PICK = >R = R> OR R> OR ; : single4? ( a b c d -- bool ) LOCALS| d c b a | a b = ... mhx
:r4 new compiler260 (5/19/2012 2:46:19 PM) comp.lang.forth :r4 is another type of Forth, more precisely, a colorforth derivative. Instead of colors, it uses prefixes, the dictionary is an array, conditionals and control structures are different to the colorforth ones, ... pabloreda(225)
intersection of circles665 (6/23/2012 12:31:55 AM) comp.lang.forth Surprisingly, the following problem isn't easily handled by a couple
of scientific computing packages:
If solution(s) exist, find the intersection points of two circles in
the x-y plane. This requires solv... krishna.myneni(990)
Reverse factorial343 (6/29/2012 1:51:29 AM) comp.lang.forth Here's a reverse factorial routine to wile away your free time.
As the routine is highly f/p intensive it can double as a benchmark
for testing relative performance between systems and implementation
detai... invalid47(646)
RfD: Make ENVIRONMENT? obsolescent243102 (7/4/2012 9:21:22 PM) comp.lang.forth Make ENVIRONMENT? obsolecent
============================
20120704 Initial proposal
Problem
=======
The Forth-94 standard specified an environmental query system, which
allows to query the system ... bernd.paysan(2408)
x64 assembler & RIP for call/jmp absolute indirect690 (7/11/2012 4:25:39 PM) comp.lang.forth (posted to c.l.forth and c.l.asm.x86)
While constructing a Forth assembler for x64 mode, I've added RIP
addressing support, and come across a slight oddball encoding during
testing the encodings. I've not ... blog1791(5)
Why not more 'advanced' tools?2240 (7/11/2012 6:10:59 PM) comp.lang.forth Most things being true in one sense, and false in another.
Why not more 'advanced' or complex tools? Because, the more the tools
do for you, the more lax the programmer can become. As the programmer
beco... jasondamisch(252)
CfV: S>F and F>S542 (8/2/2012 4:51:41 PM) comp.lang.forth This is actually a poll about how widely the proposal is implemented
and how popular it is among the programmers. It is called a CfV
(call-for-votes) because the process is inspired by the Usenet Rdf/CfV
pr... anton(5253)
Green Arrays presentation at Dark Silicon Workshop2343 (8/19/2012 12:44:02 AM) comp.lang.forth From June 2012 but I just found the slides.
http://darksilicon.ucsd.edu/2012/assets/slides/5
Title: Illuminating Dark Silicon with a Fabric of Simple Computers
Author: Charles H. Moore, Greg Bailey
Gree... no.email6(1518)
continue equivalent in Forth?6448 (8/19/2012 2:28:42 AM) comp.lang.forth When I am in a begin-while-repeat loop, I sometimes would like to go to the top of the loop. The "continue" keyword in C is what would help me perfectly here. Is there a "continue" like word in Forth?
... programmingkidx(18)
A simple SSA interpreter831 (9/11/2012 10:22:41 PM) comp.lang.forth 0 [if]
Based on the paper
@inproceedings{vonRonne:2004:IPS:1059579.1059585,
author = {von Ronne, Jeffery and Wang, Ning and Franz, Michael},
title = {Interpreting programs in static single assignment ... blog(1301)