virgil
proposal-ptc-syntax
virgil | proposal-ptc-syntax | |
---|---|---|
29 | 8 | |
897 | 165 | |
- | 0.6% | |
9.3 | 0.0 | |
9 days ago | almost 8 years ago | |
Shell | HTML | |
- | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
virgil
-
Garbage Collection for Systems Programmers
For (2) Virgil has several features that allow you to layout memory with various levels of control. I assume you meaning "array of structs", and you can do that with arrays of tuples, which will naturally be flattened and normalized based on the target (i.e. will be array-of-structs on native targets). You can define byte-exact layouts[1] (mostly for interfacing with other software and parsing binary formats), unbox ADTs, and soon you can even control the exact encoding of ADTs.
Virgil is GC'd.
[1] https://github.com/titzer/virgil/blob/master/doc/tutorial/La...
-
The Return of the Frame Pointers
Virgil doesn't use frame pointers. If you don't have dynamic stack allocation, the frame of a given function has a fixed size can be found with a simple (binary-search) table lookup. Virgil's technique uses an additional page-indexed range that further restricts the lookup to be a few comparisons on average (O(log(# retpoints per page)). It combines the unwind info with stackmaps for GC. It takes very little space.
The main driver is in (https://github.com/titzer/virgil/blob/master/rt/native/Nativ... the rest of the code in the directory implements the decoding of metadata.
I think frame pointers only make sense if frames are dynamically-sized (i.e. have stack allocation of data). Otherwise it seems weird to me that a dynamic mechanism is used when a static mechanism would suffice; mostly because no one agreed on an ABI for the metadata encoding, or an unwind routine.
I believe the 1-2% measurement number. That's in the same ballpark as pervasive checks for array bounds checks. It's weird that the odd debugging and profiling task gets special pleading for a 1% cost but adding a layer of security gets the finger. Very bizarre priorities.
-
Whose baseline (compiler) is it anyway?
This paper is the first time I seen mention of the Virgil programming language, from the same author:
https://github.com/titzer/virgil
-
JEP 450: Compact Object Headers
JavaScript handles the "no identity hash" with WeakMap and WeakSet, which are language built-ins. For Virgil, I chose to leave out identity hashes and don't really regret it. It keeps the language simple and the separation clear. HashMap (entirely library code, not a language wormhole) takes the hash function and equality function as arguments to the constructor.
[1] https://github.com/titzer/virgil/blob/master/lib/util/Map.v3
This is partly my style too; I try to avoid using maps for things unless they are really far flung, and the things that end up serving as keys in one place usually end up serving as keys in lots of other places too.
-
Retrofitting null-safety onto Java at Meta
Whoa, interesting. I didn't know Kotlin had all those constructs.
In Virgil, a method on an object (or ADT) can declare its return type as "this". Then the method implicitly returns the receiver object. That trick is very useful to allow a chain of calls such as object.foo().bar().baz(). I find it readable and easy to explain:
https://github.com/titzer/virgil/blob/master/doc/tutorial/Re...
-
A Ruby program that generates itself (through a 128-language quine loop)
I hadn't written one until ~30 mins ago [1]. I cheated and looked at a Java quine (not particularly elegant, but easy to see what is going on.), but I wrote one for Virgil. Just think string substitution; a string with a hole in it and you substitute a copy of the string, quoted into the hole. Just one substitution suffices.
[1] https://github.com/titzer/virgil/blob/master/apps/Quine/Quin...
-
Integer Conversions and Safe Comparisons in C++20
Virgil has a family of completely well-defined (i.e. no UB) fixed-size integer types with some hard-fought rules that I eventually got around to documenting here:
https://github.com/titzer/virgil/blob/master/doc/tutorial/Fi...
One of the key things is that values are never silently truncated (other than 2's-complement wrap-around) or values changed; only promotions. The only sane semantics for over-shifts (shifts larger than the size of the type) is to shift the bits out, like a window.
The upshot of all that is that Virgil has a pretty sane semantics for fixed-size integers, IMHO.
-
Show HN: We are trying to (finally) get tail-calls into the WebAssembly standard
LLVM and other compilers that use SSA but target a stack machine can run a stackification phase. Even without reordering instructions, it seems to work well in practice.
In Virgil I implemented this for both the JVM and Wasm. Here's the algorithm used for Wasm:
https://github.com/titzer/virgil/blob/master/aeneas/src/mach...
-
Hacker News top posts: Jul 2, 2022
Virgil: A fast and lightweight programming language that compiles to WASM\ (54 comments)
- Virgil: A fast and lightweight programming language that compiles to WASM
proposal-ptc-syntax
-
Time, Space and Complexity
The proposal of "syntactic tail calls" to provide an explicit syntax for tail calls, co-championed by committee members from Mozilla (responsible for SpiderMonkey, the engine of Firefox) and Microsoft, was a response to these concerns. However, this proposal is now listed among the TC39's inactive proposals, possibly due to diminished interest, which may stem from the infrequent use of tail recursive functions in JavaScript.
-
Bun, JavaScript, and TCO
This is not actually about Tail Call Optimisation, which is more flexible and optional matter of optimisation, but about Proper Tail Calls, which are actually part of the ECMAScript 6 specification (over implementer objections)—in strict mode, calls in tail position must not create additional stack frames. This is the last piece of ECMAScript 6 that most engines haven’t implemented, because it’s rather controversial: it actually causes some performance problems, and makes debugging harder, and may have security issues (in 2016, Mozilla declared it impossible to implement across realm boundaries due to their security model).
https://github.com/tc39/proposal-ptc-syntax has a lot of useful information about it all, and a proposal to make it explicit in syntax, such as with `return continue …`.
(Fun terminology problems here. The term TCO is commonly used for PTC, and PTC is very close to being a subset of TCO, but the mandatory stack frame elision which ruins debugging feels to me like it falls outside of TCO. In various situations, debuggers will mark things like “stack frame omitted” when they’ve optimised one out of existence, but you can generally compile things differently, or something like that, to prevent this. But with PTC, it feels like the engine is kinda not even allowed to know that a stack frames may be absent. So I say PTC and TCO are a little distinct, though PTC is mostly just a subset of TCO. Reminds me of the terminology of tree-shaking versus dead code removal—where the former is essentially a subset of the latter, but that the effects are just slightly different, though I’d say it’s more slight in that case than this.)
-
Show HN: We are trying to (finally) get tail-calls into the WebAssembly standard
4. Proposed something else [ https://github.com/tc39/proposal-ptc-syntax ]
While apple is against Syntactic tail calls, they’re mainly just opposed to versions of it that would remove/unrequire the tail-call optimisation they already do: https://github.com/tc39/ecma262/issues/535
For the version of it that is backwards compatible, they wouldn’t need to do anything other than recognise it as valid syntax. Their main concern is that it "could add confusion with very little benefit."
-
What happened to proper tail calls in JavaScript? (2021)
The spec for STC has a critique of PTC:
- performance
- developer tools
- Error.stack
- cross-realm tail calls
- developer intent
See: https://github.com/tc39/proposal-ptc-syntax#issues-with-ptc
Apple's 2016 response as to why they won't implement STC is here: https://github.com/tc39/ecma262/issues/535
- STC is part of the spec and will take too long to change.
- Now that they've implemented support for PTC, they don't want to regress web pages that rely on it.
- They don't want to discourage vendors from implementing PTC by agreeing to STC.
- They don't want to introduce confusion.
Some of these arguments about confusion and delays seem wrong hindsight, since on every point things would have been better if they'd just agreed to the compromise of STC.
- It would have been part of the spec years ago
- STC would have had a clear way for web pages to know when tail calls could be relied on (and PTC would have been optional)
- Other vendors didn't implement PTC in any case, despite no agreement on STC
- There's even more confusion as things are now
-
@lrvick bought the expired domain name for the 'foreach' NPM package maintainer. He now controls the package which 2.2m packages depend on.
You can see a direct example of this with Proper Tail Calls (PTC). It was added to the ECMAScript spec in 2015 as part of es6, but as of today - 7 years later - only Safari has shipped it*. As a result it is effectively not a thing in JavaScript, and the followup proposal meant to address issues with PTC ("Syntactic Tail Calls") has been basically ignored because PTC is already in the spec.
-
Node.js 14 is over 20x faster than Python3.8 for fib(n)
V8 implemented tail call optimization in the past, and the V8 team backed the TC39 proposal for syntactic tail calls (where you'd write return continue func() to make the use of TCO explicit). In Node 6 and 7 we could use them with the flag --harmony-tailcalls. The feature was removed from Node 8 after that proposal didn't go anywhere, but it's interesting, and shows some interest.
What are some alternatives?
vigil - Vigil, the eternal morally vigilant programming language
ecma262 - Status, process, and documents for ECMA-262
libratbag - A DBus daemon to configure input devices, mainly high-end and gaming mice
uwm-masters-thesis - My thesis for my Master's in Computer Science degree from the University of Wisconsin - Milwaukee.
rust-asn1 - A Rust ASN.1 (DER) serializer.
Elixir - Elixir is a dynamic, functional language for building scalable and maintainable applications
kcachegrind - GUI to profilers such as Valgrind
constant-time - Constant-time WebAssembly
v86 - x86 PC emulator and x86-to-wasm JIT, running in the browser
foreach - Foreach component + npm package
Solaar - Linux device manager for Logitech devices
rr - Record and Replay Framework