-
Things I noticed while reviewing the JoinSortMerge for #1482
### Performance concerns
* `std::map _left_row_id_has_match{};` maps are slow. Eval whether std::unordered_map would be faster. Could …
-
One big motivation I've had for going with dependent types in the first place is the idea of being able to use the same language feature (dependent records) for both modules and data types. This is si…
-
[Current type system for objects are not sound](https://github.com/pufuwozu/roy/pull/116#issuecomment-4148653).
There are several type systems with type inference algorithms for objects.
Some are p…
taku0 updated
12 years ago
-
Add a short-hand to the language append fields to a record. For example, given
```
val emps = [
{comm=0.0,deptno=20,empno=7369,ename="SMITH",hiredate="1980-12-16",
job="CLERK",mgr=7902,sal=…
-
This feature is not necessarily needed in the first-ever major release of the language.
* Why do we need them though?
It's actually like Agda's records, just a furnished Sigma type that can cont…
-
## Goals of a Type System
Passerine's type system is a bit fuzzy at the moment, due to it's dynamic nature in terms of implementation. However, Passerine is a functional programming language, and in …
-
[Paper hosted on arXiv](https://arxiv.org/abs/1406.2061v1)
[DOI (10.4204/EPTCS.153.8)](https://doi.org/10.4204/EPTCS.153.8)
## Abstract
We propose a programming model where effects are treated in…
aatxe updated
6 years ago
-
Fathom currently has anonymous product types (records), but no (convenient) way of expressing sum types.
# Potential solutions
* Do nothing. Encode sum types as dependent records (eg `let Option :…
-
[Write You a Haskell ( Stephen Diehl )](http://dev.stephendiehl.com/fun/)
- [x] Chapter 1: Introduction
- [x] Chapter 2: Haskell Basics
- [x] Chapter 3: Parsing
- [ ] Chapter 4: Lambda Calculus
- [ ] …
-
## Summary
We should call out what difference in the records caused the match to fail in addition to the current output.
## Motivation
When making heavy use of row polymorphism in a large cod…