pklausler

10 ms·

1.
by pklausler 23d ago
People assume that DO CONCURRENT implies that a loop is parallelizable. But the committee botched the standard badly, and the language allows conforming code that is not parallelizable.
2.
by pklausler 1mo ago
The standard language has had both dumb and smart pointers for 36 years. Based storage has been available as a common extension for over forty.
3.
by pklausler 1mo ago
They ruled that the “integrity of parentheses” can be violated by fused multiply-adds, despite clear long-standing language to the contrary. So “(x * y)+z” can be compiled as if it were “x * y+z” and only undergo one rounding.
4.
by pklausler 1mo ago
Sadly, Fortran’s guarantee of the “integrity of parentheses” has been undermined lately by its standard committee.
5.
by pklausler 2mo ago
This point was weird, since Fortran has never had bitwise operators, as such. (It has had bitwise intrinsic functions since the “mil-spec” extensions in the late 70’s.)
6.
by pklausler 2mo ago
Fortran seems to attract a lot of this sort of thing, perhaps because the language has had no real leadership since the ISO committee began jumping the shark in the 2000’s.
7.
by pklausler 3mo ago
That is not a particularly well-informed discussion, unfortunately.
8.
by pklausler 4mo ago
I think that the Voyager software is in assembly languages (there are several distinct computers on board), and that it is the program preparation software is written in a “Fortran V” extension.
9.
by pklausler 5mo ago
I’m glad you like it.
10.
by pklausler 5mo ago
There are good reasons to use Fortran, some having to do with the language and many to do with legacy codes. These have to be balanced with the good reasons to avoid using Fortran for new development, which also have to do with the languag
11.
by pklausler 5mo ago
Honestly, if a language can't succeed in HPC alongside (or against) Fortran with its glacial rate of buggy evolution and poor track record of portability, and C++ with its never-ending attempts at parallelism, then it's not what H
12.
by pklausler 6mo ago
I have worked on compilers (mostly) for high-performance computing for over 40 years, writing every part of a production compiler twice or more. Optimization and code generation and register allocation/scheduling are definitely the mo
13.
by pklausler 6mo ago
CUDA Fortran was first released in 2007 and now has multiple implementations.
14.
by pklausler 6mo ago
I don't think that BASIC was ever meant to be a better Fortran. Can you substantiate that claim?
15.
by pklausler 6mo ago
I have a few patents, including one for a novel machine instruction, and I recall the attorney telling me that one cannot patent mathematics, only methods and systems.
16.
by pklausler 6mo ago
I used a small custom parser combinator library to parse Fortran from raw characters (since tokenization is so context-dependent), and it's worked well.
17.
by pklausler 6mo ago
Production compilers must have robust error recovery and great error messages, and those are pretty straightforward in recursive descent, even if ad hoc.
18.
by pklausler 6mo ago
> First let’s accept the realities. The giant plagiarism machines have already stolen everything. Copyright is dead. Licenses are washed away in clean rooms. Mass surveillance and tracking are a feature, privacy is a bug. Everything is a
19.
by pklausler 6mo ago
Is there a production compiler out there that doesn't use recursive descent, preferably constructed from combinators? Table-driven parsers seem now to be a "tell" of an old compiler or a hobby project.
20.
by pklausler 6mo ago
The free market ensures that bridges stay up, because the bridge-makers don't want to get sued by people who have died in bridge collapses.
21.
by pklausler 6mo ago
The logical combinators that I know all have definitions in the untyped lambda calculus. Is there a typed variant of logical combinators?
22.
by pklausler 6mo ago
Enjoy!
23.
by pklausler 6mo ago
If you like Leuchtterm, you'll love Quo Vadis Habana notebooks, if you can find them in stock.
24.
by pklausler 6mo ago
We're definitely enforcing some of them. But the latest one from F'2023 isn't going to be.
25.
by pklausler 6mo ago
"The system worked yesterday, so it should have worked forever."
26.
by pklausler 6mo ago
The second paragraph describes the motivation. I encourage you to read the paper.
27.
by pklausler 6mo ago
This would also mean that we should design new programming languages out of sight of LLMs in case we need to hide code from them.
28.
by pklausler 6mo ago
For a standardized language, Fortran isn’t very portable across compilers. GNU Fortran has done a great job supporting legacy features, and I hope that our work in flang-new has made it easy to port to, as well. I basically ignored the ze
29.
by pklausler 6mo ago
Dummy arguments may not alias anything else, including other dummy arguments, in conforming Fortran if either are modified, with some exceptions. But there are many ways in which arrays can overlap that don’t involve dummy arguments. GNU
30.
by pklausler 6mo ago
fortran .GT. cobol

More ›