2024-10-31 07:16:19 +00:00
|
|
|
import "@stdlib/lisp-lists"
|
|
|
|
|
2024-10-31 07:11:41 +00:00
|
|
|
@method_id(101)
|
|
|
|
fun test1() {
|
2024-10-31 07:16:19 +00:00
|
|
|
var numbers: tuple = createEmptyList();
|
|
|
|
numbers = listPrepend(1, numbers);
|
|
|
|
numbers = listPrepend(2, numbers);
|
|
|
|
numbers = listPrepend(3, numbers);
|
|
|
|
numbers = listPrepend(4, numbers);
|
[Tolk] Rewrite the type system from Hindley-Milner to static typing
FunC's (and Tolk's before this PR) type system is based on Hindley-Milner.
This is a common approach for functional languages, where
types are inferred from usage through unification.
As a result, type declarations are not necessary:
() f(a,b) { return a+b; } // a and b now int, since `+` (int, int)
While this approach works for now, problems arise with the introduction
of new types like bool, where `!x` must handle both int and bool.
It will also become incompatible with int32 and other strict integers.
This will clash with structure methods, struggle with proper generics,
and become entirely impractical for union types.
This PR completely rewrites the type system targeting the future.
1) type of any expression is inferred and never changed
2) this is available because dependent expressions already inferred
3) forall completely removed, generic functions introduced
(they work like template functions actually, instantiated while inferring)
4) instantiation `<...>` syntax, example: `t.tupleAt<int>(0)`
5) `as` keyword, for example `t.tupleAt(0) as int`
6) methods binding is done along with type inferring, not before
("before", as worked previously, was always a wrong approach)
2024-12-30 15:31:27 +00:00
|
|
|
var (h: int, numbers redef) = listSplit(numbers);
|
2024-10-31 07:16:19 +00:00
|
|
|
h += listGetHead(numbers);
|
2024-10-31 07:11:41 +00:00
|
|
|
|
[Tolk] Rewrite the type system from Hindley-Milner to static typing
FunC's (and Tolk's before this PR) type system is based on Hindley-Milner.
This is a common approach for functional languages, where
types are inferred from usage through unification.
As a result, type declarations are not necessary:
() f(a,b) { return a+b; } // a and b now int, since `+` (int, int)
While this approach works for now, problems arise with the introduction
of new types like bool, where `!x` must handle both int and bool.
It will also become incompatible with int32 and other strict integers.
This will clash with structure methods, struggle with proper generics,
and become entirely impractical for union types.
This PR completely rewrites the type system targeting the future.
1) type of any expression is inferred and never changed
2) this is available because dependent expressions already inferred
3) forall completely removed, generic functions introduced
(they work like template functions actually, instantiated while inferring)
4) instantiation `<...>` syntax, example: `t.tupleAt<int>(0)`
5) `as` keyword, for example `t.tupleAt(0) as int`
6) methods binding is done along with type inferring, not before
("before", as worked previously, was always a wrong approach)
2024-12-30 15:31:27 +00:00
|
|
|
_ = null;
|
|
|
|
(_, _) = (null, null);
|
2024-10-31 07:16:19 +00:00
|
|
|
var t = createEmptyTuple();
|
2024-10-31 07:11:41 +00:00
|
|
|
do {
|
[Tolk] Rewrite the type system from Hindley-Milner to static typing
FunC's (and Tolk's before this PR) type system is based on Hindley-Milner.
This is a common approach for functional languages, where
types are inferred from usage through unification.
As a result, type declarations are not necessary:
() f(a,b) { return a+b; } // a and b now int, since `+` (int, int)
While this approach works for now, problems arise with the introduction
of new types like bool, where `!x` must handle both int and bool.
It will also become incompatible with int32 and other strict integers.
This will clash with structure methods, struggle with proper generics,
and become entirely impractical for union types.
This PR completely rewrites the type system targeting the future.
1) type of any expression is inferred and never changed
2) this is available because dependent expressions already inferred
3) forall completely removed, generic functions introduced
(they work like template functions actually, instantiated while inferring)
4) instantiation `<...>` syntax, example: `t.tupleAt<int>(0)`
5) `as` keyword, for example `t.tupleAt(0) as int`
6) methods binding is done along with type inferring, not before
("before", as worked previously, was always a wrong approach)
2024-12-30 15:31:27 +00:00
|
|
|
var num: int = numbers.listNext();
|
2024-10-31 07:18:54 +00:00
|
|
|
t.tuplePush(num);
|
2024-10-31 07:11:41 +00:00
|
|
|
} while (numbers != null);
|
|
|
|
|
|
|
|
return (h, numbers == null, t);
|
|
|
|
}
|
|
|
|
|
|
|
|
@method_id(102)
|
|
|
|
fun test2(x: int) {
|
|
|
|
if (null != x) {
|
|
|
|
var y: int = null;
|
|
|
|
if (y != null) { return 10; }
|
|
|
|
return y;
|
|
|
|
}
|
|
|
|
try {
|
|
|
|
return x + 10; // will throw, since not a number
|
|
|
|
} catch {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
return 100;
|
|
|
|
}
|
|
|
|
|
|
|
|
fun myIsNull(x: int): int {
|
|
|
|
return x == null ? -1 : x;
|
|
|
|
}
|
|
|
|
|
|
|
|
@method_id(103)
|
|
|
|
fun test3(x: int) {
|
|
|
|
return myIsNull(x > 10 ? null : x);
|
|
|
|
}
|
|
|
|
|
|
|
|
fun getUntypedNull() {
|
[Tolk] Rewrite the type system from Hindley-Milner to static typing
FunC's (and Tolk's before this PR) type system is based on Hindley-Milner.
This is a common approach for functional languages, where
types are inferred from usage through unification.
As a result, type declarations are not necessary:
() f(a,b) { return a+b; } // a and b now int, since `+` (int, int)
While this approach works for now, problems arise with the introduction
of new types like bool, where `!x` must handle both int and bool.
It will also become incompatible with int32 and other strict integers.
This will clash with structure methods, struggle with proper generics,
and become entirely impractical for union types.
This PR completely rewrites the type system targeting the future.
1) type of any expression is inferred and never changed
2) this is available because dependent expressions already inferred
3) forall completely removed, generic functions introduced
(they work like template functions actually, instantiated while inferring)
4) instantiation `<...>` syntax, example: `t.tupleAt<int>(0)`
5) `as` keyword, for example `t.tupleAt(0) as int`
6) methods binding is done along with type inferring, not before
("before", as worked previously, was always a wrong approach)
2024-12-30 15:31:27 +00:00
|
|
|
var untyped: null = null;
|
2024-10-31 07:11:41 +00:00
|
|
|
if (true) {
|
|
|
|
return untyped;
|
|
|
|
}
|
|
|
|
return untyped;
|
|
|
|
}
|
|
|
|
|
|
|
|
@method_id(104)
|
[Tolk] Rewrite the type system from Hindley-Milner to static typing
FunC's (and Tolk's before this PR) type system is based on Hindley-Milner.
This is a common approach for functional languages, where
types are inferred from usage through unification.
As a result, type declarations are not necessary:
() f(a,b) { return a+b; } // a and b now int, since `+` (int, int)
While this approach works for now, problems arise with the introduction
of new types like bool, where `!x` must handle both int and bool.
It will also become incompatible with int32 and other strict integers.
This will clash with structure methods, struggle with proper generics,
and become entirely impractical for union types.
This PR completely rewrites the type system targeting the future.
1) type of any expression is inferred and never changed
2) this is available because dependent expressions already inferred
3) forall completely removed, generic functions introduced
(they work like template functions actually, instantiated while inferring)
4) instantiation `<...>` syntax, example: `t.tupleAt<int>(0)`
5) `as` keyword, for example `t.tupleAt(0) as int`
6) methods binding is done along with type inferring, not before
("before", as worked previously, was always a wrong approach)
2024-12-30 15:31:27 +00:00
|
|
|
fun test4(): null {
|
|
|
|
var (_, (_, untyped: null)) = (3, (createEmptyTuple, null));
|
2024-10-31 07:11:41 +00:00
|
|
|
if (true) {
|
|
|
|
return untyped;
|
|
|
|
}
|
|
|
|
return untyped;
|
|
|
|
}
|
|
|
|
|
|
|
|
@method_id(105)
|
|
|
|
fun test5() {
|
[Tolk] Rewrite the type system from Hindley-Milner to static typing
FunC's (and Tolk's before this PR) type system is based on Hindley-Milner.
This is a common approach for functional languages, where
types are inferred from usage through unification.
As a result, type declarations are not necessary:
() f(a,b) { return a+b; } // a and b now int, since `+` (int, int)
While this approach works for now, problems arise with the introduction
of new types like bool, where `!x` must handle both int and bool.
It will also become incompatible with int32 and other strict integers.
This will clash with structure methods, struggle with proper generics,
and become entirely impractical for union types.
This PR completely rewrites the type system targeting the future.
1) type of any expression is inferred and never changed
2) this is available because dependent expressions already inferred
3) forall completely removed, generic functions introduced
(they work like template functions actually, instantiated while inferring)
4) instantiation `<...>` syntax, example: `t.tupleAt<int>(0)`
5) `as` keyword, for example `t.tupleAt(0) as int`
6) methods binding is done along with type inferring, not before
("before", as worked previously, was always a wrong approach)
2024-12-30 15:31:27 +00:00
|
|
|
var n: slice = getUntypedNull();
|
2024-10-31 07:18:54 +00:00
|
|
|
return !(null == n) ? n.loadInt(32) : 100;
|
2024-10-31 07:11:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
@method_id(107)
|
|
|
|
fun test7() {
|
2024-10-31 07:16:19 +00:00
|
|
|
var b = beginCell().storeMaybeRef(null);
|
|
|
|
var s = b.endCell().beginParse();
|
2024-10-31 07:18:54 +00:00
|
|
|
var c = s.loadMaybeRef();
|
2025-01-13 08:21:24 +00:00
|
|
|
return (null == c) as int * 10 + (b != null) as int;
|
2024-10-31 07:11:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
fun main() {
|
|
|
|
// now, the compiler doesn't optimize this at compile-time, fif codegen contains ifs
|
|
|
|
var i: int = null;
|
|
|
|
if (i == null) {
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 10;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
@testcase | 101 | | 7 -1 [ 3 2 1 ]
|
|
|
|
@testcase | 102 | 5 | (null)
|
|
|
|
@testcase | 102 | null | -1
|
|
|
|
@testcase | 103 | 5 | 5
|
|
|
|
@testcase | 103 | 15 | -1
|
|
|
|
@testcase | 104 | | (null)
|
|
|
|
@testcase | 105 | | 100
|
|
|
|
@testcase | 107 | | -11
|
|
|
|
@fif_codegen
|
|
|
|
"""
|
|
|
|
test1 PROC:<{
|
|
|
|
//
|
|
|
|
PUSHNULL // numbers
|
|
|
|
1 PUSHINT // numbers _2=1
|
|
|
|
SWAP // _2=1 numbers
|
|
|
|
CONS // numbers
|
|
|
|
2 PUSHINT // numbers _4=2
|
|
|
|
SWAP // _4=2 numbers
|
|
|
|
CONS // numbers
|
|
|
|
3 PUSHINT // numbers _6=3
|
|
|
|
SWAP // _6=3 numbers
|
|
|
|
CONS // numbers
|
|
|
|
4 PUSHINT // numbers _8=4
|
|
|
|
SWAP // _8=4 numbers
|
|
|
|
CONS // numbers
|
|
|
|
UNCONS // h numbers
|
|
|
|
DUP // h numbers numbers
|
|
|
|
CAR // h numbers _12
|
|
|
|
"""
|
|
|
|
|
|
|
|
@fif_codegen
|
|
|
|
"""
|
|
|
|
main PROC:<{
|
|
|
|
//
|
|
|
|
PUSHNULL // i
|
|
|
|
ISNULL // _2
|
|
|
|
IFJMP:<{ //
|
|
|
|
1 PUSHINT // _3=1
|
|
|
|
}> //
|
|
|
|
10 PUSHINT // _4=10
|
|
|
|
}>
|
|
|
|
"""
|
|
|
|
|
|
|
|
@fif_codegen
|
|
|
|
"""
|
|
|
|
test7 PROC:<{
|
|
|
|
...
|
[Tolk] AST-based semantic analysis, get rid of Expr
This is a huge refactoring focusing on untangling compiler internals
(previously forked from FunC).
The goal is to convert AST directly to Op (a kind of IR representation),
doing all code analysis at AST level.
Noteable changes:
- AST-based semantic kernel includes: registering global symbols,
scope handling and resolving local/global identifiers,
lvalue/rvalue calc and check, implicit return detection,
mutability analysis, pure/impure validity checks,
simple constant folding
- values of `const` variables are calculated NOT based on CodeBlob,
but via a newly-introduced AST-based constant evaluator
- AST vertices are now inherited from expression/statement/other;
expression vertices have common properties (TypeExpr, lvalue/rvalue)
- symbol table is rewritten completely, SymDef/SymVal no longer exist,
lexer now doesn't need to register identifiers
- AST vertices have references to symbols, filled at different
stages of pipeline
- the remaining "FunC legacy part" is almost unchanged besides Expr
which was fully dropped; AST is converted to Ops (IR) directly
2024-12-16 18:19:45 +00:00
|
|
|
LDOPTREF // b _18 _17
|
2024-10-31 07:11:41 +00:00
|
|
|
DROP // b c
|
[Tolk] AST-based semantic analysis, get rid of Expr
This is a huge refactoring focusing on untangling compiler internals
(previously forked from FunC).
The goal is to convert AST directly to Op (a kind of IR representation),
doing all code analysis at AST level.
Noteable changes:
- AST-based semantic kernel includes: registering global symbols,
scope handling and resolving local/global identifiers,
lvalue/rvalue calc and check, implicit return detection,
mutability analysis, pure/impure validity checks,
simple constant folding
- values of `const` variables are calculated NOT based on CodeBlob,
but via a newly-introduced AST-based constant evaluator
- AST vertices are now inherited from expression/statement/other;
expression vertices have common properties (TypeExpr, lvalue/rvalue)
- symbol table is rewritten completely, SymDef/SymVal no longer exist,
lexer now doesn't need to register identifiers
- AST vertices have references to symbols, filled at different
stages of pipeline
- the remaining "FunC legacy part" is almost unchanged besides Expr
which was fully dropped; AST is converted to Ops (IR) directly
2024-12-16 18:19:45 +00:00
|
|
|
ISNULL // b _11
|
|
|
|
10 MULCONST // b _13
|
|
|
|
SWAP // _13 b
|
|
|
|
ISNULL // _13 _14
|
2025-01-13 08:21:24 +00:00
|
|
|
NOT // _13 _15
|
[Tolk] AST-based semantic analysis, get rid of Expr
This is a huge refactoring focusing on untangling compiler internals
(previously forked from FunC).
The goal is to convert AST directly to Op (a kind of IR representation),
doing all code analysis at AST level.
Noteable changes:
- AST-based semantic kernel includes: registering global symbols,
scope handling and resolving local/global identifiers,
lvalue/rvalue calc and check, implicit return detection,
mutability analysis, pure/impure validity checks,
simple constant folding
- values of `const` variables are calculated NOT based on CodeBlob,
but via a newly-introduced AST-based constant evaluator
- AST vertices are now inherited from expression/statement/other;
expression vertices have common properties (TypeExpr, lvalue/rvalue)
- symbol table is rewritten completely, SymDef/SymVal no longer exist,
lexer now doesn't need to register identifiers
- AST vertices have references to symbols, filled at different
stages of pipeline
- the remaining "FunC legacy part" is almost unchanged besides Expr
which was fully dropped; AST is converted to Ops (IR) directly
2024-12-16 18:19:45 +00:00
|
|
|
ADD // _16
|
2024-10-31 07:11:41 +00:00
|
|
|
}>
|
|
|
|
"""
|
|
|
|
*/
|