[core] introduce models

2024-10-04 15:21:43 +08:00
87 changed files with 5795 additions and 5389 deletions
--- a/.pre-commit-config.yaml
+++ b/.pre-commit-config.yaml
@ -1,7 +1,7 @@
 # See https://pre-commit.com for more information
 # See https://pre-commit.com/hooks.html for more hooks
-default_stages: [pre-commit]
+default_stages: [commit]
 repos:
  - repo: local
--- a/Cargo.lock
+++ b/Cargo.lock
@ -26,9 +26,9 @@ dependencies = [
 [[package]]
 name = "anstream"
-version = "0.6.18"
+version = "0.6.15"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "8acc5369981196006228e28809f761875c0327210a891e941f4c683b3a99529b"
+checksum = "64e15c1ab1f89faffbf04a634d5e1962e9074f2741eef6d97f3c4e322426d526"
 dependencies = [
 "anstyle",
 "anstyle-parse",
@ -41,36 +41,36 @@ dependencies = [
 [[package]]
 name = "anstyle"
-version = "1.0.10"
+version = "1.0.8"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "55cc3b69f167a1ef2e161439aa98aed94e6028e5f9a59be9a6ffb47aef1651f9"
+checksum = "1bec1de6f59aedf83baf9ff929c98f2ad654b97c9510f4e70cf6f661d49fd5b1"
 [[package]]
 name = "anstyle-parse"
-version = "0.2.6"
+version = "0.2.5"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "3b2d16507662817a6a20a9ea92df6652ee4f94f914589377d69f3b21bc5798a9"
+checksum = "eb47de1e80c2b463c735db5b217a0ddc39d612e7ac9e2e96a5aed1f57616c1cb"
 dependencies = [
 "utf8parse",
 ]
 [[package]]
 name = "anstyle-query"
-version = "1.1.2"
+version = "1.1.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "79947af37f4177cfead1110013d678905c37501914fba0efea834c3fe9a8d60c"
+checksum = "6d36fc52c7f6c869915e99412912f22093507da8d9e942ceaf66fe4b7c14422a"
 dependencies = [
- "windows-sys 0.59.0",
+ "windows-sys 0.52.0",
 ]
 [[package]]
 name = "anstyle-wincon"
-version = "3.0.6"
+version = "3.0.4"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "2109dbce0e72be3ec00bed26e6a7479ca384ad226efdd66db8fa2e3a38c83125"
+checksum = "5bf74e1b6e971609db8ca7a9ce79fd5768ab6ae46441c572e46cf596f59e57f8"
 dependencies = [
 "anstyle",
- "windows-sys 0.59.0",
+ "windows-sys 0.52.0",
 ]
 [[package]]
@ -126,9 +126,9 @@ checksum = "1fd0f2584146f6f2ef48085050886acf353beff7305ebd1ae69500e27c67f64b"
 [[package]]
 name = "cc"
-version = "1.2.1"
+version = "1.1.24"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "fd9de9f2205d5ef3fd67e685b0df337994ddd4495e2a28d185500d0e1edfea47"
+checksum = "812acba72f0a070b003d3697490d2b55b837230ae7c6c6497f05cc2ddbb8d938"
 dependencies = [
 "shlex",
 ]
@ -141,9 +141,9 @@ checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd"
 [[package]]
 name = "clap"
-version = "4.5.21"
+version = "4.5.19"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "fb3b4b9e5a7c7514dfa52869339ee98b3156b0bfb4e8a77c4ff4babb64b1604f"
+checksum = "7be5744db7978a28d9df86a214130d106a89ce49644cbc4e3f0c22c3fba30615"
 dependencies = [
 "clap_builder",
 "clap_derive",
@ -151,9 +151,9 @@ dependencies = [
 [[package]]
 name = "clap_builder"
-version = "4.5.21"
+version = "4.5.19"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "b17a95aa67cc7b5ebd32aa5370189aa0d79069ef1c64ce893bd30fb24bff20ec"
+checksum = "a5fbc17d3ef8278f55b282b2a2e75ae6f6c7d4bb70ed3d0382375104bfafdb4b"
 dependencies = [
 "anstream",
 "anstyle",
@ -170,20 +170,20 @@ dependencies = [
 "heck 0.5.0",
 "proc-macro2",
 "quote",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
 [[package]]
 name = "clap_lex"
-version = "0.7.3"
+version = "0.7.2"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "afb84c814227b90d6895e01398aee0d8033c00e7466aca416fb6a8e0eb19d8a7"
+checksum = "1462739cb27611015575c0c11df5df7601141071f07518d56fcc1be504cbec97"
 [[package]]
 name = "colorchoice"
-version = "1.0.3"
+version = "1.0.2"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "5b63caa9aa9397e2d9480a9b13673856c78d8ac123288526c37d7839f2a86990"
+checksum = "d3fd119d74b830634cea2a0f58bbd0d54540518a14397557951e79340abc28c0"
 [[package]]
 name = "console"
@ -199,9 +199,9 @@ dependencies = [
 [[package]]
 name = "cpufeatures"
-version = "0.2.15"
+version = "0.2.14"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "0ca741a962e1b0bff6d724a1a0958b686406e853bb14061f218562e1896f95e6"
+checksum = "608697df725056feaccfa42cffdaeeec3fccc4ffc38358ecd19b243e716a78e0"
 dependencies = [
 "libc",
 ]
@ -282,12 +282,6 @@ dependencies = [
 "crypto-common",
 ]
 [[package]]
 name = "dissimilar"
 version = "1.0.9"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "59f8e79d1fbf76bdfbde321e902714bf6c49df88a7dda6fc682fc2979226962d"
 [[package]]
 name = "either"
 version = "1.13.0"
@ -327,9 +321,9 @@ dependencies = [
 [[package]]
 name = "fastrand"
-version = "2.2.0"
+version = "2.1.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "486f806e73c5707928240ddc295403b1b93c96a02038563881c4a2fd84b81ac4"
+checksum = "e8c02a5121d4ea3eb16a80748c74f5549a5665e4c21333c6098f283870fbdea6"
 [[package]]
 name = "fixedbitset"
@ -376,12 +370,6 @@ dependencies = [
 "wasi",
 ]
 [[package]]
 name = "glob"
 version = "0.3.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "d2fabcfbdc87f4758337ca535fb41a6d701b65693ce38287d856d1674551ec9b"
 [[package]]
 name = "hashbrown"
 version = "0.12.3"
@ -399,9 +387,9 @@ dependencies = [
 [[package]]
 name = "hashbrown"
-version = "0.15.1"
+version = "0.15.0"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "3a9bfc1af68b1726ea47d3d5109de126281def866b33970e10fbab11b5dafab3"
+checksum = "1e087f84d4f86bf4b218b927129862374b72199ae7d8657835f1e89000eea4fb"
 [[package]]
 name = "heck"
@ -441,7 +429,7 @@ source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "707907fe3c25f5424cce2cb7e1cbcafee6bdbe735ca90ef77c29e84591e5b9da"
 dependencies = [
 "equivalent",
- "hashbrown 0.15.1",
+ "hashbrown 0.15.0",
 ]
 [[package]]
@ -472,7 +460,7 @@ checksum = "9dd28cfd4cfba665d47d31c08a6ba637eed16770abca2eccbbc3ca831fef1e44"
 dependencies = [
 "proc-macro2",
 "quote",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
 [[package]]
@ -559,9 +547,9 @@ checksum = "bbd2bcb4c963f2ddae06a2efc7e9f3591312473c50c6685e1f298068316e66fe"
 [[package]]
 name = "libc"
-version = "0.2.164"
+version = "0.2.159"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "433bfe06b8c75da9b2e3fbea6e5329ff87748f0b144ef75306e674c3f6f7c13f"
+checksum = "561d97a539a36e26a9a5fad1ea11a3039a67714694aaa379433e580854bc3dc5"
 [[package]]
 name = "libloading"
@ -646,6 +634,7 @@ name = "nac3ast"
 version = "0.1.0"
 dependencies = [
 "fxhash",
 "lazy_static",
 "parking_lot",
 "string-interner",
 ]
@ -660,7 +649,6 @@ dependencies = [
 "inkwell",
 "insta",
 "itertools",
 "nac3core_derive",
 "nac3parser",
 "parking_lot",
 "rayon",
@ -670,18 +658,6 @@ dependencies = [
 "test-case",
 ]
 [[package]]
 name = "nac3core_derive"
 version = "0.1.0"
 dependencies = [
 "nac3core",
 "proc-macro-error",
 "proc-macro2",
 "quote",
 "syn 2.0.87",
 "trybuild",
 ]
 [[package]]
 name = "nac3ld"
 version = "0.1.0"
@ -722,9 +698,12 @@ checksum = "650eef8c711430f1a879fdd01d4745a7deea475becfb90269c06775983bbf086"
 [[package]]
 name = "once_cell"
-version = "1.20.2"
+version = "1.20.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "1261fe7e33c73b354eab43b1273a57c8f967d0391e80353e51f764ac02cf6775"
+checksum = "82881c4be219ab5faaf2ad5e5e5ecdff8c66bd7402ca3160975c93b24961afd1"
 dependencies = [
 "portable-atomic",
 ]
 [[package]]
 name = "parking_lot"
@ -799,7 +778,7 @@ dependencies = [
 "phf_shared 0.11.2",
 "proc-macro2",
 "quote",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
 [[package]]
@ -847,35 +826,11 @@ version = "0.1.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "925383efa346730478fb4838dbe9137d2a47675ad789c546d150a6e1dd4ab31c"
 [[package]]
 name = "proc-macro-error"
 version = "1.0.4"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "da25490ff9892aab3fcf7c36f08cfb902dd3e71ca0f9f9517bea02a73a5ce38c"
 dependencies = [
 "proc-macro-error-attr",
 "proc-macro2",
 "quote",
 "syn 1.0.109",
 "version_check",
 ]
 [[package]]
 name = "proc-macro-error-attr"
 version = "1.0.4"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "a1be40180e52ecc98ad80b184934baf3d0d29f979574e439af5a55274b35f869"
 dependencies = [
 "proc-macro2",
 "quote",
 "version_check",
 ]
 [[package]]
 name = "proc-macro2"
-version = "1.0.89"
+version = "1.0.86"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "f139b0662de085916d1fb67d2b4169d1addddda1919e696f3252b740b629986e"
+checksum = "5e719e8df665df0d1c8fbfd238015744736151d4445ec0836b8e628aae103b77"
 dependencies = [
 "unicode-ident",
 ]
@ -927,7 +882,7 @@ dependencies = [
 "proc-macro2",
 "pyo3-macros-backend",
 "quote",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
 [[package]]
@ -940,7 +895,7 @@ dependencies = [
 "proc-macro2",
 "pyo3-build-config",
 "quote",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
 [[package]]
@ -1013,9 +968,9 @@ dependencies = [
 [[package]]
 name = "regex"
-version = "1.11.1"
+version = "1.11.0"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "b544ef1b4eac5dc2db33ea63606ae9ffcfac26c1416a2806ae0bf5f56b201191"
+checksum = "38200e5ee88914975b69f657f0801b6f6dccafd44fd9326302a4aaeecfacb1d8"
 dependencies = [
 "aho-corasick",
 "memchr",
@ -1025,9 +980,9 @@ dependencies = [
 [[package]]
 name = "regex-automata"
-version = "0.4.9"
+version = "0.4.8"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "809e8dc61f6de73b46c85f4c96486310fe304c434cfa43669d7b40f711150908"
+checksum = "368758f23274712b504848e9d5a6f010445cc8b87a7cdb4d7cbee666c1288da3"
 dependencies = [
 "aho-corasick",
 "memchr",
@ -1049,9 +1004,9 @@ dependencies = [
 [[package]]
 name = "rustix"
-version = "0.38.41"
+version = "0.38.37"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "d7f649912bc1495e167a6edee79151c84b1bad49748cb4f1f1167f459f6224f6"
+checksum = "8acb788b847c24f28525660c4d7758620a7210875711f79e7f663cc152726811"
 dependencies = [
 "bitflags",
 "errno",
@ -1062,9 +1017,9 @@ dependencies = [
 [[package]]
 name = "rustversion"
-version = "1.0.18"
+version = "1.0.17"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "0e819f2bc632f285be6d7cd36e25940d45b2391dd6d9b939e79de557f7014248"
+checksum = "955d28af4278de8121b7ebeb796b6a45735dc01436d898801014aced2773a3d6"
 [[package]]
 name = "ryu"
@ -1095,29 +1050,29 @@ checksum = "61697e0a1c7e512e84a621326239844a24d8207b4669b41bc18b32ea5cbf988b"
 [[package]]
 name = "serde"
-version = "1.0.215"
+version = "1.0.210"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "6513c1ad0b11a9376da888e3e0baa0077f1aed55c17f50e7b2397136129fb88f"
+checksum = "c8e3592472072e6e22e0a54d5904d9febf8508f65fb8552499a1abc7d1078c3a"
 dependencies = [
 "serde_derive",
 ]
 [[package]]
 name = "serde_derive"
-version = "1.0.215"
+version = "1.0.210"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "ad1e866f866923f252f05c889987993144fb74e722403468a4ebd70c3cd756c0"
+checksum = "243902eda00fad750862fc144cea25caca5e20d615af0a81bee94ca738f1df1f"
 dependencies = [
 "proc-macro2",
 "quote",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
 [[package]]
 name = "serde_json"
-version = "1.0.133"
+version = "1.0.128"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "c7fceb2473b9166b2294ef05efcb65a3db80803f0b03ef86a5fc88a2b85ee377"
+checksum = "6ff5456707a1de34e7e37f2a6fd3d3f808c318259cbd01ab6377795054b483d8"
 dependencies = [
 "itoa",
 "memchr",
@ -1125,15 +1080,6 @@ dependencies = [
 "serde",
 ]
 [[package]]
 name = "serde_spanned"
 version = "0.6.8"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "87607cb1398ed59d48732e575a4c28a7a8ebf2454b964fe3f224f2afc07909e1"
 dependencies = [
 "serde",
 ]
 [[package]]
 name = "serde_yaml"
 version = "0.8.26"
@ -1226,7 +1172,7 @@ dependencies = [
 "proc-macro2",
 "quote",
 "rustversion",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
 [[package]]
@ -1242,9 +1188,9 @@ dependencies = [
 [[package]]
 name = "syn"
-version = "2.0.87"
+version = "2.0.79"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "25aa4ce346d03a6dcd68dd8b4010bcb74e54e62c90c573f394c46eae99aba32d"
+checksum = "89132cd0bf050864e1d38dc3bbc07a0eb8e7530af26344d3d2bbbef83499f590"
 dependencies = [
 "proc-macro2",
 "quote",
@ -1257,17 +1203,11 @@ version = "0.12.16"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "61c41af27dd6d1e27b1b16b489db798443478cef1f06a660c96db617ba5de3b1"
 [[package]]
 name = "target-triple"
 version = "0.1.3"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "42a4d50cdb458045afc8131fd91b64904da29548bcb63c7236e0844936c13078"
 [[package]]
 name = "tempfile"
-version = "3.14.0"
+version = "3.13.0"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "28cce251fcbc87fac86a866eeb0d6c2d536fc16d06f184bb61aeae11aa4cee0c"
+checksum = "f0f2c9fc62d0beef6951ccffd757e241266a2c833136efbe35af6cd2567dca5b"
 dependencies = [
 "cfg-if",
 "fastrand",
@ -1286,15 +1226,6 @@ dependencies = [
 "windows-sys 0.52.0",
 ]
 [[package]]
 name = "termcolor"
 version = "1.4.1"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "06794f8f6c5c898b3275aebefa6b8a1cb24cd2c6c79397ab15774837a0bc5755"
 dependencies = [
 "winapi-util",
 ]
 [[package]]
 name = "test-case"
 version = "1.2.3"
@ -1310,72 +1241,22 @@ dependencies = [
 [[package]]
 name = "thiserror"
-version = "1.0.69"
+version = "1.0.64"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "b6aaf5339b578ea85b50e080feb250a3e8ae8cfcdff9a461c9ec2904bc923f52"
+checksum = "d50af8abc119fb8bb6dbabcfa89656f46f84aa0ac7688088608076ad2b459a84"
 dependencies = [
 "thiserror-impl",
 ]
 [[package]]
 name = "thiserror-impl"
-version = "1.0.69"
+version = "1.0.64"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "4fee6c4efc90059e10f81e6d42c60a18f76588c3d74cb83a0b242a2b6c7504c1"
+checksum = "08904e7672f5eb876eaaf87e0ce17857500934f4981c4a0ab2b4aa98baac7fc3"
 dependencies = [
 "proc-macro2",
 "quote",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
 [[package]]
 name = "toml"
 version = "0.8.19"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "a1ed1f98e3fdc28d6d910e6737ae6ab1a93bf1985935a1193e68f93eeb68d24e"
 dependencies = [
 "serde",
 "serde_spanned",
 "toml_datetime",
 "toml_edit",
 ]
 [[package]]
 name = "toml_datetime"
 version = "0.6.8"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "0dd7358ecb8fc2f8d014bf86f6f638ce72ba252a2c3a2572f2a795f1d23efb41"
 dependencies = [
 "serde",
 ]
 [[package]]
 name = "toml_edit"
 version = "0.22.22"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "4ae48d6208a266e853d946088ed816055e556cc6028c5e8e2b84d9fa5dd7c7f5"
 dependencies = [
 "indexmap 2.6.0",
 "serde",
 "serde_spanned",
 "toml_datetime",
 "winnow",
 ]
 [[package]]
 name = "trybuild"
 version = "1.0.101"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "8dcd332a5496c026f1e14b7f3d2b7bd98e509660c04239c58b0ba38a12daded4"
 dependencies = [
 "dissimilar",
 "glob",
 "serde",
 "serde_derive",
 "serde_json",
 "target-triple",
 "termcolor",
 "toml",
 ]
 [[package]]
@ -1601,15 +1482,6 @@ version = "0.52.6"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "589f6da84c646204747d1270a2a5661ea66ed1cced2631d546fdfb155959f9ec"
 [[package]]
 name = "winnow"
 version = "0.6.20"
 source = "registry+https://github.com/rust-lang/crates.io-index"
 checksum = "36c1fec1a2bb5866f07c25f68c26e565c4c200aebb96d7e55710c19d3e8ac49b"
 dependencies = [
 "memchr",
 ]
 [[package]]
 name = "yaml-rust"
 version = "0.4.5"
@ -1637,5 +1509,5 @@ checksum = "fa4f8080344d4671fb4e831a13ad1e68092748387dfc4f55e356242fae12ce3e"
 dependencies = [
 "proc-macro2",
 "quote",
- "syn 2.0.87",
+ "syn 2.0.79",
 ]
--- a/Cargo.toml
+++ b/Cargo.toml
@ -4,7 +4,6 @@ members = [
  "nac3ast",
  "nac3parser",
  "nac3core",
  "nac3core/nac3core_derive",
  "nac3standalone",
  "nac3artiq",
  "runkernel",
--- a/flake.lock
+++ b/flake.lock
@ -2,11 +2,11 @@
  "nodes": {
    "nixpkgs": {
      "locked": {
-        "lastModified": 1731319897,
+        "lastModified": 1727348695,
-        "narHash": "sha256-PbABj4tnbWFMfBp6OcUK5iGy1QY+/Z96ZcLpooIbuEI=",
+        "narHash": "sha256-J+PeFKSDV+pHL7ukkfpVzCOO7mBSrrpJ3svwBFABbhI=",
        "owner": "NixOS",
        "repo": "nixpkgs",
-        "rev": "dc460ec76cbff0e66e269457d7b728432263166c",
+        "rev": "1925c603f17fc89f4c8f6bf6f631a802ad85d784",
        "type": "github"
      },
      "original": {
--- a/flake.nix
+++ b/flake.nix
@ -107,18 +107,18 @@
            (pkgs.fetchFromGitHub {
              owner = "m-labs";
              repo = "sipyco";
-              rev = "094a6cd63ffa980ef63698920170e50dc9ba77fd";
+              rev = "939f84f9b5eef7efbf7423c735d1834783b6140e";
-              sha256 = "sha256-PPnAyDedUQ7Og/Cby9x5OT9wMkNGTP8GS53V6N/dk4w=";
+              sha256 = "sha256-15Nun4EY35j+6SPZkjzZtyH/ncxLS60KuGJjFh5kSTc=";
            })
            (pkgs.fetchFromGitHub {
              owner = "m-labs";
              repo = "artiq";
-              rev = "28c9de3e251daa89a8c9fd79d5ab64a3ec03bac6";
+              rev = "923ca3377d42c815f979983134ec549dc39d3ca0";
-              sha256 = "sha256-vAvpbHc5B+1wtG8zqN7j9dQE1ON+i22v+uqA+tw6Gak=";
+              sha256 = "sha256-oJoEeNEeNFSUyh6jXG8Tzp6qHVikeHS0CzfE+mODPgw=";
            })
          ];
          buildInputs = [
-            (python3-mimalloc.withPackages(ps: [ ps.numpy ps.scipy ps.jsonschema ps.lmdb ps.platformdirs nac3artiq-instrumented ]))
+            (python3-mimalloc.withPackages(ps: [ ps.numpy ps.scipy ps.jsonschema ps.lmdb nac3artiq-instrumented ]))
            pkgs.llvmPackages_14.llvm.out
          ];
          phases = [ "buildPhase" "installPhase" ];
--- a/nac3artiq/demo/min_artiq.py
+++ b/nac3artiq/demo/min_artiq.py
@ -206,7 +206,7 @@ class Core:
        embedding = EmbeddingMap()
        if allow_registration:
-            compiler.analyze(registered_functions, registered_classes, set())
+            compiler.analyze(registered_functions, registered_classes)
            allow_registration = False
        if hasattr(method, "__self__"):
--- a/nac3artiq/src/codegen.rs
+++ b/nac3artiq/src/codegen.rs
@ -14,15 +14,14 @@ use pyo3::{
 use nac3core::{
    codegen::{
        classes::{
            ArrayLikeIndexer, ArrayLikeValue, ArraySliceValue, ListValue, NDArrayType,
            NDArrayValue, ProxyType, ProxyValue, RangeValue, UntypedArrayLikeAccessor,
        },
        expr::{destructure_range, gen_call},
        irrt::call_ndarray_calc_size,
        llvm_intrinsics::{call_int_smax, call_memcpy_generic, call_stackrestore, call_stacksave},
        stmt::{gen_block, gen_for_callback_incrementing, gen_if_callback, gen_with},
        types::{NDArrayType, ProxyType},
        values::{
            ArrayLikeIndexer, ArrayLikeValue, ArraySliceValue, ListValue, NDArrayValue, ProxyValue,
            RangeValue, UntypedArrayLikeAccessor,
        },
        CodeGenContext, CodeGenerator,
    },
    inkwell::{
@ -38,7 +37,7 @@ use nac3core::{
    typecheck::typedef::{iter_type_vars, FunSignature, FuncArg, Type, TypeEnum, VarMap},
 };
-use super::{symbol_resolver::InnerResolver, timeline::TimeFns};
+use crate::{symbol_resolver::InnerResolver, timeline::TimeFns};
 /// The parallelism mode within a block.
 #[derive(Copy, Clone, Eq, PartialEq)]
@ -461,7 +460,7 @@ fn format_rpc_arg<'ctx>(
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, arg_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let llvm_arg_ty = NDArrayType::new(generator, ctx.ctx, llvm_elem_ty);
-            let llvm_arg = llvm_arg_ty.map_value(arg.into_pointer_value(), None);
+            let llvm_arg = NDArrayValue::from_ptr_val(arg.into_pointer_value(), llvm_usize, None);
            let llvm_usize_sizeof = ctx
                .builder
@ -498,7 +497,7 @@ fn format_rpc_arg<'ctx>(
            call_memcpy_generic(
                ctx,
                pbuffer_dims_begin,
-                llvm_arg.shape().base_ptr(ctx, generator),
+                llvm_arg.dim_sizes().base_ptr(ctx, generator),
                dims_buf_sz,
                llvm_i1.const_zero(),
            );
@ -612,7 +611,7 @@ fn format_rpc_ret<'ctx>(
            // Set `ndarray.ndims`
            ndarray.store_ndims(ctx, generator, llvm_usize.const_int(ndims, false));
            // Allocate `ndarray.shape` [size_t; ndims]
-            ndarray.create_shape(ctx, llvm_usize, ndarray.load_ndims(ctx));
+            ndarray.create_dim_sizes(ctx, llvm_usize, ndarray.load_ndims(ctx));
            /*
                ndarray now:
@ -702,7 +701,7 @@ fn format_rpc_ret<'ctx>(
            call_memcpy_generic(
                ctx,
-                ndarray.shape().base_ptr(ctx, generator),
+                ndarray.dim_sizes().base_ptr(ctx, generator),
                pbuffer_dims,
                sizeof_dims,
                llvm_i1.const_zero(),
@ -714,7 +713,7 @@ fn format_rpc_ret<'ctx>(
            // `ndarray.shape` must be initialized beforehand in this implementation
            //   (for ndarray.create_data() to know how many elements to allocate)
            let num_elements =
-                call_ndarray_calc_size(generator, ctx, &ndarray.shape(), (None, None));
+                call_ndarray_calc_size(generator, ctx, &ndarray.dim_sizes(), (None, None));
            // debug_assert(nelems * sizeof(T) >= ndarray_nbytes)
            if ctx.registry.llvm_options.opt_level == OptimizationLevel::None {
@ -991,12 +990,11 @@ fn rpc_codegen_callback_fn<'ctx>(
    }
 }
-pub fn attributes_writeback<'ctx>(
+pub fn attributes_writeback(
-    ctx: &mut CodeGenContext<'ctx, '_>,
+    ctx: &mut CodeGenContext<'_, '_>,
    generator: &mut dyn CodeGenerator,
    inner_resolver: &InnerResolver,
    host_attributes: &PyObject,
    return_obj: Option<(Type, ValueEnum<'ctx>)>,
 ) -> Result<(), String> {
    Python::with_gil(|py| -> PyResult<Result<(), String>> {
        let host_attributes: &PyList = host_attributes.downcast(py)?;
@ -1006,11 +1004,6 @@ pub fn attributes_writeback<'ctx>(
        let zero = int32.const_zero();
        let mut values = Vec::new();
        let mut scratch_buffer = Vec::new();
        if let Some((ty, obj)) = return_obj {
            values.push((ty, obj.to_basic_value_enum(ctx, generator, ty).unwrap()));
        }
        for val in (*globals).values() {
            let val = val.as_ref(py);
            let ty = inner_resolver.get_obj_type(
@ -1089,7 +1082,7 @@ pub fn attributes_writeback<'ctx>(
        let args: Vec<_> =
            values.into_iter().map(|(_, val)| (None, ValueEnum::Dynamic(val))).collect();
        if let Err(e) =
-            rpc_codegen_callback_fn(ctx, None, (&fun, PrimDef::Int32.id()), args, generator, true)
+            rpc_codegen_callback_fn(ctx, None, (&fun, PrimDef::Int32.id()), args, generator, false)
        {
            return Ok(Err(e));
        }
@ -1315,8 +1308,7 @@ fn polymorphic_print<'ctx>(
                fmt.push('[');
                flush(ctx, generator, &mut fmt, &mut args);
-                let val =
+                let val = ListValue::from_ptr_val(value.into_pointer_value(), llvm_usize, None);
                    ListValue::from_pointer_value(value.into_pointer_value(), llvm_usize, None);
                let len = val.load_size(ctx, None);
                let last =
                    ctx.builder.build_int_sub(len, llvm_usize.const_int(1, false), "").unwrap();
@ -1368,18 +1360,12 @@ fn polymorphic_print<'ctx>(
            TypeEnum::TObj { obj_id, .. } if *obj_id == PrimDef::NDArray.id() => {
                let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, ty);
                let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
                fmt.push_str("array([");
                flush(ctx, generator, &mut fmt, &mut args);
-                let val = NDArrayValue::from_pointer_value(
+                let val = NDArrayValue::from_ptr_val(value.into_pointer_value(), llvm_usize, None);
-                    value.into_pointer_value(),
+                let len = call_ndarray_calc_size(generator, ctx, &val.dim_sizes(), (None, None));
                    llvm_elem_ty,
                    llvm_usize,
                    None,
                );
                let len = call_ndarray_calc_size(generator, ctx, &val.shape(), (None, None));
                let last =
                    ctx.builder.build_int_sub(len, llvm_usize.const_int(1, false), "").unwrap();
@ -1432,7 +1418,7 @@ fn polymorphic_print<'ctx>(
                fmt.push_str("range(");
                flush(ctx, generator, &mut fmt, &mut args);
-                let val = RangeValue::from_pointer_value(value.into_pointer_value(), None);
+                let val = RangeValue::from_ptr_val(value.into_pointer_value(), None);
                let (start, stop, step) = destructure_range(ctx, val);
--- a/nac3artiq/src/lib.rs
+++ b/nac3artiq/src/lib.rs
@ -1,4 +1,10 @@
-#![deny(future_incompatible, let_underscore, nonstandard_style, clippy::all)]
+#![deny(
    future_incompatible,
    let_underscore,
    nonstandard_style,
    rust_2024_compatibility,
    clippy::all
 )]
 #![warn(clippy::pedantic)]
 #![allow(
    unsafe_op_in_unsafe_fn,
@ -24,19 +30,19 @@ use parking_lot::{Mutex, RwLock};
 use pyo3::{
    create_exception, exceptions,
    prelude::*,
-    types::{PyBytes, PyDict, PyNone, PySet},
+    types::{PyBytes, PyDict, PySet},
 };
 use tempfile::{self, TempDir};
 use nac3core::{
    codegen::{
        concrete_type::ConcreteTypeStore, gen_func_impl, irrt::load_irrt, CodeGenLLVMOptions,
-        CodeGenTargetMachineOptions, CodeGenTask, CodeGenerator, WithCall, WorkerRegistry,
+        CodeGenTargetMachineOptions, CodeGenTask, WithCall, WorkerRegistry,
    },
    inkwell::{
        context::Context,
        memory_buffer::MemoryBuffer,
-        module::{FlagBehavior, Linkage, Module},
+        module::{Linkage, Module},
        passes::PassBuilderOptions,
        support::is_multithreaded,
        targets::*,
@ -59,11 +65,13 @@ use nac3core::{
 };
 use nac3ld::Linker;
-use codegen::{
+use crate::{
-    attributes_writeback, gen_core_log, gen_rtio_log, rpc_codegen_callback, ArtiqCodeGenerator,
+    codegen::{
        attributes_writeback, gen_core_log, gen_rtio_log, rpc_codegen_callback, ArtiqCodeGenerator,
    },
    symbol_resolver::{DeferredEvaluationStore, InnerResolver, PythonHelper, Resolver},
    timeline::TimeFns,
 };
 use symbol_resolver::{DeferredEvaluationStore, InnerResolver, PythonHelper, Resolver};
 use timeline::TimeFns;
 mod codegen;
 mod symbol_resolver;
@ -142,32 +150,14 @@ impl Nac3 {
        module: &PyObject,
        registered_class_ids: &HashSet<u64>,
    ) -> PyResult<()> {
-        let (module_name, source_file, source) =
+        let (module_name, source_file) = Python::with_gil(|py| -> PyResult<(String, String)> {
-            Python::with_gil(|py| -> PyResult<(String, String, String)> {
+            let module: &PyAny = module.extract(py)?;
-                let module: &PyAny = module.extract(py)?;
+            Ok((module.getattr("__name__")?.extract()?, module.getattr("__file__")?.extract()?))
-                let source_file = module.getattr("__file__");
+        })?;
                let (source_file, source) = if let Ok(source_file) = source_file {
                    let source_file = source_file.extract()?;
                    (
                        source_file,
                        fs::read_to_string(source_file).map_err(|e| {
                            exceptions::PyIOError::new_err(format!(
                                "failed to read input file: {e}"
                            ))
                        })?,
                    )
                } else {
                    // kernels submitted by content have no file
                    // but still can provide source by StringLoader
                    let get_src_fn = module
                        .getattr("__loader__")?
                        .extract::<PyObject>()?
                        .getattr(py, "get_source")?;
                    ("<expcontent>", get_src_fn.call1(py, (PyNone::get(py),))?.extract(py)?)
                };
                Ok((module.getattr("__name__")?.extract()?, source_file.to_string(), source))
            })?;
        let source = fs::read_to_string(&source_file).map_err(|e| {
            exceptions::PyIOError::new_err(format!("failed to read input file: {e}"))
        })?;
        let parser_result = parse_program(&source, source_file.into())
            .map_err(|e| exceptions::PySyntaxError::new_err(format!("parse error: {e}")))?;
@ -685,12 +675,33 @@ impl Nac3 {
        let task = CodeGenTask {
            subst: Vec::default(),
            symbol_name: "__modinit__".to_string(),
            body: instance.body,
            signature,
            resolver: resolver.clone(),
            store,
            unifier_index: instance.unifier_id,
            calls: instance.calls,
            id: 0,
        };
        let mut store = ConcreteTypeStore::new();
        let mut cache = HashMap::new();
        let signature = store.from_signature(
            &mut composer.unifier,
            &self.primitive,
            &fun_signature,
            &mut cache,
        );
        let signature = store.add_cty(signature);
        let attributes_writeback_task = CodeGenTask {
            subst: Vec::default(),
            symbol_name: "attributes_writeback".to_string(),
            body: Arc::new(Vec::default()),
            signature,
            resolver,
            store,
            unifier_index: instance.unifier_id,
-            calls: instance.calls,
+            calls: Arc::new(HashMap::default()),
            id: 0,
        };
@ -714,27 +725,19 @@ impl Nac3 {
            .collect();
        let membuffer = membuffers.clone();
        let mut has_return = false;
        py.allow_threads(|| {
            let (registry, handles) =
                WorkerRegistry::create_workers(threads, top_level.clone(), &self.llvm_options, &f);
            registry.add_task(task);
            registry.wait_tasks_complete(handles);
-            let mut generator = ArtiqCodeGenerator::new("main".to_string(), size_t, self.time_fns);
+            let mut generator =
                ArtiqCodeGenerator::new("attributes_writeback".to_string(), size_t, self.time_fns);
            let context = Context::create();
-            let module = context.create_module("main");
+            let module = context.create_module("attributes_writeback");
            let target_machine = self.llvm_options.create_target_machine().unwrap();
            module.set_data_layout(&target_machine.get_target_data().get_data_layout());
            module.set_triple(&target_machine.get_triple());
            module.add_basic_value_flag(
                "Debug Info Version",
                FlagBehavior::Warning,
                context.i32_type().const_int(3, false),
            );
            module.add_basic_value_flag(
                "Dwarf Version",
                FlagBehavior::Warning,
                context.i32_type().const_int(4, false),
            );
            let builder = context.create_builder();
            let (_, module, _) = gen_func_impl(
                &context,
@ -742,27 +745,9 @@ impl Nac3 {
                &registry,
                builder,
                module,
-                task,
+                attributes_writeback_task,
                |generator, ctx| {
-                    assert_eq!(instance.body.len(), 1, "toplevel module should have 1 statement");
+                    attributes_writeback(ctx, generator, inner_resolver.as_ref(), &host_attributes)
                    let StmtKind::Expr { value: ref expr, .. } = instance.body[0].node else {
                        unreachable!("toplevel statement must be an expression")
                    };
                    let ExprKind::Call { .. } = expr.node else {
                        unreachable!("toplevel expression must be a function call")
                    };
                    let return_obj =
                        generator.gen_expr(ctx, expr)?.map(|value| (expr.custom.unwrap(), value));
                    has_return = return_obj.is_some();
                    registry.wait_tasks_complete(handles);
                    attributes_writeback(
                        ctx,
                        generator,
                        inner_resolver.as_ref(),
                        &host_attributes,
                        return_obj,
                    )
                },
            )
            .unwrap();
@ -771,23 +756,35 @@ impl Nac3 {
            membuffer.lock().push(buffer);
        });
        embedding_map.setattr("expects_return", has_return).unwrap();
        // Link all modules into `main`.
        let buffers = membuffers.lock();
        let main = context
-            .create_module_from_ir(MemoryBuffer::create_from_memory_range(
+            .create_module_from_ir(MemoryBuffer::create_from_memory_range(&buffers[0], "main"))
                buffers.last().unwrap(),
                "main",
            ))
            .unwrap();
-        for buffer in buffers.iter().rev().skip(1) {
+        for buffer in buffers.iter().skip(1) {
            let other = context
                .create_module_from_ir(MemoryBuffer::create_from_memory_range(buffer, "main"))
                .unwrap();
            main.link_in_module(other).map_err(|err| CompileError::new_err(err.to_string()))?;
        }
        let builder = context.create_builder();
        let modinit_return = main
            .get_function("__modinit__")
            .unwrap()
            .get_last_basic_block()
            .unwrap()
            .get_terminator()
            .unwrap();
        builder.position_before(&modinit_return);
        builder
            .build_call(
                main.get_function("attributes_writeback").unwrap(),
                &[],
                "attributes_writeback",
            )
            .unwrap();
        main.link_in_module(irrt).map_err(|err| CompileError::new_err(err.to_string()))?;
        let mut function_iter = main.get_first_function();
@ -1090,12 +1087,7 @@ impl Nac3 {
        })
    }
-    fn analyze(
+    fn analyze(&mut self, functions: &PySet, classes: &PySet) -> PyResult<()> {
        &mut self,
        functions: &PySet,
        classes: &PySet,
        content_modules: &PySet,
    ) -> PyResult<()> {
        let (modules, class_ids) =
            Python::with_gil(|py| -> PyResult<(HashMap<u64, PyObject>, HashSet<u64>)> {
                let mut modules: HashMap<u64, PyObject> = HashMap::new();
@ -1105,21 +1097,13 @@ impl Nac3 {
                let getmodule_fn = PyModule::import(py, "inspect")?.getattr("getmodule")?;
                for function in functions {
-                    let module: PyObject = getmodule_fn.call1((function,))?.extract()?;
+                    let module = getmodule_fn.call1((function,))?.extract()?;
-                    if !module.is_none(py) {
+                    modules.insert(id_fn.call1((&module,))?.extract()?, module);
                        modules.insert(id_fn.call1((&module,))?.extract()?, module);
                    }
                }
                for class in classes {
-                    let module: PyObject = getmodule_fn.call1((class,))?.extract()?;
+                    let module = getmodule_fn.call1((class,))?.extract()?;
                    if !module.is_none(py) {
                        modules.insert(id_fn.call1((&module,))?.extract()?, module);
                    }
                    class_ids.insert(id_fn.call1((class,))?.extract()?);
                }
                for module in content_modules {
                    let module: PyObject = module.extract()?;
                    modules.insert(id_fn.call1((&module,))?.extract()?, module);
                    class_ids.insert(id_fn.call1((class,))?.extract()?);
                }
                Ok((modules, class_ids))
            })?;
--- a/nac3artiq/src/symbol_resolver.rs
+++ b/nac3artiq/src/symbol_resolver.rs
@ -15,7 +15,7 @@ use pyo3::{
 use nac3core::{
    codegen::{
-        types::{NDArrayType, ProxyType},
+        classes::{NDArrayType, ProxyType},
        CodeGenContext, CodeGenerator,
    },
    inkwell::{
@ -37,7 +37,7 @@ use nac3core::{
    },
 };
-use super::PrimitivePythonId;
+use crate::PrimitivePythonId;
 pub enum PrimitiveValue {
    I32(i32),
@ -1096,7 +1096,7 @@ impl InnerResolver {
                if self.global_value_ids.read().contains_key(&id) {
                    let global = ctx.module.get_global(&id_str).unwrap_or_else(|| {
                        ctx.module.add_global(
-                            ndarray_llvm_ty.as_base_type().get_element_type().into_struct_type(),
+                            ndarray_llvm_ty.as_underlying_type(),
                            Some(AddressSpace::default()),
                            &id_str,
                        )
@ -1190,24 +1190,20 @@ impl InnerResolver {
            data_global.set_initializer(&data);
            // create a global for the ndarray object and initialize it
-            let value = ndarray_llvm_ty
+            let value = ndarray_llvm_ty.as_underlying_type().const_named_struct(&[
-                .as_base_type()
+                llvm_usize.const_int(ndarray_ndims, false).into(),
-                .get_element_type()
+                shape_global
-                .into_struct_type()
+                    .as_pointer_value()
-                .const_named_struct(&[
+                    .const_cast(llvm_usize.ptr_type(AddressSpace::default()))
-                    llvm_usize.const_int(ndarray_ndims, false).into(),
+                    .into(),
-                    shape_global
+                data_global
-                        .as_pointer_value()
+                    .as_pointer_value()
-                        .const_cast(llvm_usize.ptr_type(AddressSpace::default()))
+                    .const_cast(ndarray_dtype_llvm_ty.ptr_type(AddressSpace::default()))
-                        .into(),
+                    .into(),
-                    data_global
+            ]);
                        .as_pointer_value()
                        .const_cast(ndarray_dtype_llvm_ty.ptr_type(AddressSpace::default()))
                        .into(),
                ]);
            let ndarray = ctx.module.add_global(
-                ndarray_llvm_ty.as_base_type().get_element_type().into_struct_type(),
+                ndarray_llvm_ty.as_underlying_type(),
                Some(AddressSpace::default()),
                &id_str,
            );
--- a/nac3ast/Cargo.toml
+++ b/nac3ast/Cargo.toml
@ -10,6 +10,7 @@ constant-optimization = ["fold"]
 fold = []
 [dependencies]
 lazy_static = "1.5"
 parking_lot = "0.12"
 string-interner = "0.17"
 fxhash = "0.2"
--- a/nac3ast/src/ast_gen.rs
+++ b/nac3ast/src/ast_gen.rs
@ -5,12 +5,14 @@ pub use crate::location::Location;
 use fxhash::FxBuildHasher;
 use parking_lot::{Mutex, MutexGuard};
-use std::{cell::RefCell, collections::HashMap, fmt, sync::LazyLock};
+use std::{cell::RefCell, collections::HashMap, fmt};
 use string_interner::{symbol::SymbolU32, DefaultBackend, StringInterner};
 pub type Interner = StringInterner<DefaultBackend, FxBuildHasher>;
-static INTERNER: LazyLock<Mutex<Interner>> =
+lazy_static! {
-    LazyLock::new(|| Mutex::new(StringInterner::with_hasher(FxBuildHasher::default())));
+    static ref INTERNER: Mutex<Interner> =
        Mutex::new(StringInterner::with_hasher(FxBuildHasher::default()));
 }
 thread_local! {
    static LOCAL_INTERNER: RefCell<HashMap<String, StrRef>> = RefCell::default();
--- a/nac3ast/src/lib.rs
+++ b/nac3ast/src/lib.rs
@ -1,4 +1,10 @@
-#![deny(future_incompatible, let_underscore, nonstandard_style, clippy::all)]
+#![deny(
    future_incompatible,
    let_underscore,
    nonstandard_style,
    rust_2024_compatibility,
    clippy::all
 )]
 #![warn(clippy::pedantic)]
 #![allow(
    clippy::missing_errors_doc,
@ -8,6 +14,9 @@
    clippy::wildcard_imports
 )]
 #[macro_use]
 extern crate lazy_static;
 mod ast_gen;
 mod constant;
 #[cfg(feature = "fold")]
--- a/nac3core/Cargo.toml
+++ b/nac3core/Cargo.toml
@ -5,8 +5,6 @@ authors = ["M-Labs"]
 edition = "2021"
 [features]
 default = ["derive"]
 derive = ["dep:nac3core_derive"]
 no-escape-analysis = []
 [dependencies]
@ -15,7 +13,6 @@ crossbeam = "0.8"
 indexmap = "2.6"
 parking_lot = "0.12"
 rayon = "1.10"
 nac3core_derive = { path = "nac3core_derive", optional = true }
 nac3parser = { path = "../nac3parser" }
 strum = "0.26"
 strum_macros = "0.26"
--- a/nac3core/build.rs
+++ b/nac3core/build.rs
@ -56,8 +56,9 @@ fn main() {
    let output = Command::new("clang-irrt")
        .args(flags)
        .output()
-        .inspect(|o| {
+        .map(|o| {
            assert!(o.status.success(), "{}", std::str::from_utf8(&o.stderr).unwrap());
            o
        })
        .unwrap();
--- a/nac3core/irrt/irrt.cpp
+++ b/nac3core/irrt/irrt.cpp
@ -1,4 +1,5 @@
 #include "irrt/exception.hpp"
 #include "irrt/int_types.hpp"
 #include "irrt/list.hpp"
 #include "irrt/math.hpp"
 #include "irrt/ndarray.hpp"
--- a/nac3core/irrt/irrt/cslice.hpp
+++ b/nac3core/irrt/irrt/cslice.hpp
@ -4,6 +4,6 @@
 template<typename SizeT>
 struct CSlice {
-    void* base;
+    uint8_t* base;
    SizeT len;
 };
--- a/nac3core/irrt/irrt/exception.hpp
+++ b/nac3core/irrt/irrt/exception.hpp
@ -6,7 +6,7 @@
 /**
 * @brief The int type of ARTIQ exception IDs.
 */
-using ExceptionId = int32_t;
+typedef int32_t ExceptionId;
 /*
 * Set of exceptions C++ IRRT can use.
@ -55,14 +55,11 @@ void _raise_exception_helper(ExceptionId id,
                             int64_t param2) {
    Exception<SizeT> e = {
        .id = id,
-        .filename = {.base = reinterpret_cast<void*>(const_cast<char*>(filename)),
+        .filename = {.base = reinterpret_cast<const uint8_t*>(filename), .len = __builtin_strlen(filename)},
                     .len = static_cast<SizeT>(__builtin_strlen(filename))},
        .line = line,
        .column = 0,
-        .function = {.base = reinterpret_cast<void*>(const_cast<char*>(function)),
+        .function = {.base = reinterpret_cast<const uint8_t*>(function), .len = __builtin_strlen(function)},
-                     .len = static_cast<SizeT>(__builtin_strlen(function))},
+        .msg = {.base = reinterpret_cast<const uint8_t*>(msg), .len = __builtin_strlen(msg)},
        .msg = {.base = reinterpret_cast<void*>(const_cast<char*>(msg)),
                .len = static_cast<SizeT>(__builtin_strlen(msg))},
    };
    e.params[0] = param0;
    e.params[1] = param1;
@ -70,7 +67,6 @@ void _raise_exception_helper(ExceptionId id,
    __nac3_raise(reinterpret_cast<void*>(&e));
    __builtin_unreachable();
 }
 }  // namespace
 /**
 * @brief Raise an exception with location details (location in the IRRT source files).
@ -83,3 +79,4 @@ void _raise_exception_helper(ExceptionId id,
 */
 #define raise_exception(SizeT, id, msg, param0, param1, param2) \
    _raise_exception_helper<SizeT>(id, __FILE__, __LINE__, __FUNCTION__, msg, param0, param1, param2)
 }  // namespace
--- a/nac3core/irrt/irrt/int_types.hpp
+++ b/nac3core/irrt/irrt/int_types.hpp
@ -8,17 +8,12 @@ using uint32_t = unsigned _BitInt(32);
 using int64_t = _BitInt(64);
 using uint64_t = unsigned _BitInt(64);
 #else
 #pragma clang diagnostic push
 #pragma clang diagnostic ignored "-Wdeprecated-type"
 using int8_t = _ExtInt(8);
 using uint8_t = unsigned _ExtInt(8);
 using int32_t = _ExtInt(32);
 using uint32_t = unsigned _ExtInt(32);
 using int64_t = _ExtInt(64);
 using uint64_t = unsigned _ExtInt(64);
 #pragma clang diagnostic pop
 #endif
 // NDArray indices are always `uint32_t`.
--- a/nac3core/irrt/irrt/list.hpp
+++ b/nac3core/irrt/irrt/list.hpp
@ -13,12 +13,12 @@ extern "C" {
 SliceIndex __nac3_list_slice_assign_var_size(SliceIndex dest_start,
                                             SliceIndex dest_end,
                                             SliceIndex dest_step,
-                                             void* dest_arr,
+                                             uint8_t* dest_arr,
                                             SliceIndex dest_arr_len,
                                             SliceIndex src_start,
                                             SliceIndex src_end,
                                             SliceIndex src_step,
-                                             void* src_arr,
+                                             uint8_t* src_arr,
                                             SliceIndex src_arr_len,
                                             const SliceIndex size) {
    /* if dest_arr_len == 0, do nothing since we do not support extending list */
@ -29,13 +29,11 @@ SliceIndex __nac3_list_slice_assign_var_size(SliceIndex dest_start,
        const SliceIndex src_len = (src_end >= src_start) ? (src_end - src_start + 1) : 0;
        const SliceIndex dest_len = (dest_end >= dest_start) ? (dest_end - dest_start + 1) : 0;
        if (src_len > 0) {
-            __builtin_memmove(static_cast<uint8_t*>(dest_arr) + dest_start * size,
+            __builtin_memmove(dest_arr + dest_start * size, src_arr + src_start * size, src_len * size);
                              static_cast<uint8_t*>(src_arr) + src_start * size, src_len * size);
        }
        if (dest_len > 0) {
            /* dropping */
-            __builtin_memmove(static_cast<uint8_t*>(dest_arr) + (dest_start + src_len) * size,
+            __builtin_memmove(dest_arr + (dest_start + src_len) * size, dest_arr + (dest_end + 1) * size,
                              static_cast<uint8_t*>(dest_arr) + (dest_end + 1) * size,
                              (dest_arr_len - dest_end - 1) * size);
        }
        /* shrink size */
@ -46,7 +44,7 @@ SliceIndex __nac3_list_slice_assign_var_size(SliceIndex dest_start,
                          && !(max(dest_start, dest_end) < min(src_start, src_end)
                               || max(src_start, src_end) < min(dest_start, dest_end));
    if (need_alloca) {
-        void* tmp = __builtin_alloca(src_arr_len * size);
+        uint8_t* tmp = reinterpret_cast<uint8_t*>(__builtin_alloca(src_arr_len * size));
        __builtin_memcpy(tmp, src_arr, src_arr_len * size);
        src_arr = tmp;
    }
@ -55,24 +53,20 @@ SliceIndex __nac3_list_slice_assign_var_size(SliceIndex dest_start,
    for (; (src_step > 0) ? (src_ind <= src_end) : (src_ind >= src_end); src_ind += src_step, dest_ind += dest_step) {
        /* for constant optimization */
        if (size == 1) {
-            __builtin_memcpy(static_cast<uint8_t*>(dest_arr) + dest_ind, static_cast<uint8_t*>(src_arr) + src_ind, 1);
+            __builtin_memcpy(dest_arr + dest_ind, src_arr + src_ind, 1);
        } else if (size == 4) {
-            __builtin_memcpy(static_cast<uint8_t*>(dest_arr) + dest_ind * 4,
+            __builtin_memcpy(dest_arr + dest_ind * 4, src_arr + src_ind * 4, 4);
                             static_cast<uint8_t*>(src_arr) + src_ind * 4, 4);
        } else if (size == 8) {
-            __builtin_memcpy(static_cast<uint8_t*>(dest_arr) + dest_ind * 8,
+            __builtin_memcpy(dest_arr + dest_ind * 8, src_arr + src_ind * 8, 8);
                             static_cast<uint8_t*>(src_arr) + src_ind * 8, 8);
        } else {
            /* memcpy for var size, cannot overlap after previous alloca */
-            __builtin_memcpy(static_cast<uint8_t*>(dest_arr) + dest_ind * size,
+            __builtin_memcpy(dest_arr + dest_ind * size, src_arr + src_ind * size, size);
                             static_cast<uint8_t*>(src_arr) + src_ind * size, size);
        }
    }
    /* only dest_step == 1 can we shrink the dest list. */
    /* size should be ensured prior to calling this function */
    if (dest_step == 1 && dest_end >= dest_start) {
-        __builtin_memmove(static_cast<uint8_t*>(dest_arr) + dest_ind * size,
+        __builtin_memmove(dest_arr + dest_ind * size, dest_arr + (dest_end + 1) * size,
                          static_cast<uint8_t*>(dest_arr) + (dest_end + 1) * size,
                          (dest_arr_len - dest_end - 1) * size);
        return dest_arr_len - (dest_end - dest_ind) - 1;
    }
--- a/nac3core/irrt/irrt/math.hpp
+++ b/nac3core/irrt/irrt/math.hpp
@ -90,4 +90,4 @@ double __nac3_j0(double x) {
    return j0(x);
 }
-}  // namespace
+}
--- a/nac3core/irrt/irrt/ndarray.hpp
+++ b/nac3core/irrt/irrt/ndarray.hpp
@ -141,4 +141,4 @@ void __nac3_ndarray_calc_broadcast_idx64(const uint64_t* src_dims,
                                         NDIndex* out_idx) {
    __nac3_ndarray_calc_broadcast_idx_impl(src_dims, src_ndims, in_idx, out_idx);
 }
-}  // namespace
+}
--- a/nac3core/irrt/irrt/slice.hpp
+++ b/nac3core/irrt/irrt/slice.hpp
@ -25,4 +25,4 @@ SliceIndex __nac3_range_slice_len(const SliceIndex start, const SliceIndex end,
        return 0;
    }
 }
-}  // namespace
+}
--- a/nac3core/nac3core_derive/Cargo.toml
+++ b/nac3core/nac3core_derive/Cargo.toml
@ -1,21 +0,0 @@
 [package]
 name = "nac3core_derive"
 version = "0.1.0"
 edition = "2021"
 [lib]
 proc-macro = true
 [[test]]
 name = "structfields_tests"
 path = "tests/structfields_test.rs"
 [dev-dependencies]
 nac3core = { path = ".." }
 trybuild = { version = "1.0", features = ["diff"] }
 [dependencies]
 proc-macro2 = "1.0"
 proc-macro-error = "1.0"
 syn = "2.0"
 quote = "1.0"
--- a/nac3core/nac3core_derive/src/lib.rs
+++ b/nac3core/nac3core_derive/src/lib.rs
@ -1,320 +0,0 @@
 use proc_macro::TokenStream;
 use proc_macro_error::{abort, proc_macro_error};
 use quote::quote;
 use syn::{
    parse_macro_input, spanned::Spanned, Data, DataStruct, Expr, ExprField, ExprMethodCall,
    ExprPath, GenericArgument, Ident, LitStr, Path, PathArguments, Type, TypePath,
 };
 /// Extracts all generic arguments of a [`Type`] into a [`Vec`].
 ///
 /// Returns [`Some`] of a possibly-empty [`Vec`] if the path of `ty` matches with
 /// `expected_ty_name`, otherwise returns [`None`].
 fn extract_generic_args(expected_ty_name: &'static str, ty: &Type) -> Option<Vec<GenericArgument>> {
    let Type::Path(TypePath { qself: None, path, .. }) = ty else {
        return None;
    };
    let segments = &path.segments;
    if segments.len() != 1 {
        return None;
    };
    let segment = segments.iter().next().unwrap();
    if segment.ident != expected_ty_name {
        return None;
    }
    let PathArguments::AngleBracketed(path_args) = &segment.arguments else {
        return Some(Vec::new());
    };
    let args = &path_args.args;
    Some(args.iter().cloned().collect::<Vec<_>>())
 }
 /// Maps a `path` matching one of the `target_idents` into the `replacement` [`Ident`].
 fn map_path_to_ident(path: &Path, target_idents: &[&str], replacement: &str) -> Option<Ident> {
    path.require_ident()
        .ok()
        .filter(|ident| target_idents.iter().any(|target| ident == target))
        .map(|ident| Ident::new(replacement, ident.span()))
 }
 /// Extracts the left-hand side of a dot-expression.
 fn extract_dot_operand(expr: &Expr) -> Option<&Expr> {
    match expr {
        Expr::MethodCall(ExprMethodCall { receiver: operand, .. })
        | Expr::Field(ExprField { base: operand, .. }) => Some(operand),
        _ => None,
    }
 }
 /// Replaces the top-level receiver of a dot-expression with an [`Ident`], returning `Some(&mut expr)` if the
 /// replacement is performed.
 ///
 /// The top-level receiver is the left-most receiver expression, e.g. the top-level receiver of `a.b.c.foo()` is `a`.
 fn replace_top_level_receiver(expr: &mut Expr, ident: Ident) -> Option<&mut Expr> {
    if let Expr::MethodCall(ExprMethodCall { receiver: operand, .. })
    | Expr::Field(ExprField { base: operand, .. }) = expr
    {
        return if extract_dot_operand(operand).is_some() {
            if replace_top_level_receiver(operand, ident).is_some() {
                Some(expr)
            } else {
                None
            }
        } else {
            *operand = Box::new(Expr::Path(ExprPath {
                attrs: Vec::default(),
                qself: None,
                path: ident.into(),
            }));
            Some(expr)
        };
    }
    None
 }
 /// Iterates all operands to the left-hand side of the `.` of an [expression][`Expr`], i.e. the container operand of all
 /// [`Expr::Field`] and the receiver operand of all [`Expr::MethodCall`].
 ///
 /// The iterator will return the operand expressions in reverse order of appearance. For example, `a.b.c.func()` will
 /// return `vec![c, b, a]`.
 fn iter_dot_operands(expr: &Expr) -> impl Iterator<Item = &Expr> {
    let mut o = extract_dot_operand(expr);
    std::iter::from_fn(move || {
        let this = o;
        o = o.as_ref().and_then(|o| extract_dot_operand(o));
        this
    })
 }
 /// Normalizes a value expression for use when creating an instance of this structure, returning a
 /// [`proc_macro2::TokenStream`] of tokens representing the normalized expression.
 fn normalize_value_expr(expr: &Expr) -> proc_macro2::TokenStream {
    match &expr {
        Expr::Path(ExprPath { qself: None, path, .. }) => {
            if let Some(ident) = map_path_to_ident(path, &["usize", "size_t"], "llvm_usize") {
                quote! { #ident }
            } else {
                abort!(
                    path,
                    format!(
                        "Expected one of `size_t`, `usize`, or an implicit call expression in #[value_type(...)], found {}", 
                        quote!(#expr).to_string(),
                    )
                )
            }
        }
        Expr::Call(_) => {
            quote! { ctx.#expr }
        }
        Expr::MethodCall(_) => {
            let base_receiver = iter_dot_operands(expr).last();
            match base_receiver {
                // `usize.{...}`, `size_t.{...}` -> Rewrite the identifiers to `llvm_usize`
                Some(Expr::Path(ExprPath { qself: None, path, .. }))
                    if map_path_to_ident(path, &["usize", "size_t"], "llvm_usize").is_some() =>
                {
                    let ident =
                        map_path_to_ident(path, &["usize", "size_t"], "llvm_usize").unwrap();
                    let mut expr = expr.clone();
                    let expr = replace_top_level_receiver(&mut expr, ident).unwrap();
                    quote!(#expr)
                }
                // `ctx.{...}`, `context.{...}` -> Rewrite the identifiers to `ctx`
                Some(Expr::Path(ExprPath { qself: None, path, .. }))
                    if map_path_to_ident(path, &["ctx", "context"], "ctx").is_some() =>
                {
                    let ident = map_path_to_ident(path, &["ctx", "context"], "ctx").unwrap();
                    let mut expr = expr.clone();
                    let expr = replace_top_level_receiver(&mut expr, ident).unwrap();
                    quote!(#expr)
                }
                // No reserved identifier prefix -> Prepend `ctx.` to the entire expression
                _ => quote! { ctx.#expr },
            }
        }
        _ => {
            abort!(
                expr,
                format!(
                    "Expected one of `size_t`, `usize`, or an implicit call expression in #[value_type(...)], found {}", 
                    quote!(#expr).to_string(),
                )
            )
        }
    }
 }
 /// Derives an implementation of `codegen::types::structure::StructFields`.
 ///
 /// The benefit of using `#[derive(StructFields)]` is that all index- or order-dependent logic required by
 /// `impl StructFields` is automatically generated by this implementation, including the field index as required by
 /// `StructField::new` and the fields as returned by `StructFields::to_vec`.
 ///
 /// # Prerequisites
 ///
 /// In order to derive from [`StructFields`], you must implement (or derive) [`Eq`] and [`Copy`] as required by
 /// `StructFields`.
 ///
 /// Moreover, `#[derive(StructFields)]` can only be used for `struct`s with named fields, and may only contain fields
 /// with either `StructField` or [`PhantomData`] types.
 ///
 /// # Attributes for [`StructFields`]
 ///
 /// Each `StructField` field must be declared with the `#[value_type(...)]` attribute. The argument of `value_type`
 /// accepts one of the following:
 ///
 /// - An expression returning an instance of `inkwell::types::BasicType` (with or without the receiver `ctx`/`context`).
 /// For example, `context.i8_type()`, `ctx.i8_type()`, and `i8_type()` all refer to `i8`.
 /// - The reserved identifiers `usize` and `size_t` referring to an `inkwell::types::IntType` of the platform-dependent
 /// integer size. `usize` and `size_t` can also be used as the receiver to other method calls, e.g.
 /// `usize.array_type(3)`.
 ///
 /// # Example
 ///
 /// The following is an example of an LLVM slice implemented using `#[derive(StructFields)]`.
 ///
 /// ```rust,ignore
 /// use nac3core::{
 ///     codegen::types::structure::StructField,
 ///     inkwell::{
 ///         values::{IntValue, PointerValue},
 ///         AddressSpace,
 ///     },
 /// };
 /// use nac3core_derive::StructFields;
 ///
 /// // All classes that implement StructFields must also implement Eq and Copy
 /// #[derive(PartialEq, Eq, Clone, Copy, StructFields)]
 /// pub struct SliceValue<'ctx> {
 ///     // Declares ptr have a value type of i8*
 ///     //
 ///     // Can also be written as `ctx.i8_type().ptr_type(...)` or `context.i8_type().ptr_type(...)`
 ///     #[value_type(i8_type().ptr_type(AddressSpace::default()))]
 ///     ptr: StructField<'ctx, PointerValue<'ctx>>,
 ///
 ///     // Declares len have a value type of usize, depending on the target compilation platform
 ///     #[value_type(usize)]
 ///     len: StructField<'ctx, IntValue<'ctx>>,
 /// }
 /// ```
 #[proc_macro_derive(StructFields, attributes(value_type))]
 #[proc_macro_error]
 pub fn derive(input: TokenStream) -> TokenStream {
    let input = parse_macro_input!(input as syn::DeriveInput);
    let ident = &input.ident;
    let Data::Struct(DataStruct { fields, .. }) = &input.data else {
        abort!(input, "Only structs with named fields are supported");
    };
    if let Err(err_span) =
        fields
            .iter()
            .try_for_each(|field| if field.ident.is_some() { Ok(()) } else { Err(field.span()) })
    {
        abort!(err_span, "Only structs with named fields are supported");
    };
    // Check if struct<'ctx>
    if input.generics.params.len() != 1 {
        abort!(input.generics, "Expected exactly 1 generic parameter")
    }
    let phantom_info = fields
        .iter()
        .filter(|field| extract_generic_args("PhantomData", &field.ty).is_some())
        .map(|field| field.ident.as_ref().unwrap())
        .cloned()
        .collect::<Vec<_>>();
    let field_info = fields
        .iter()
        .filter(|field| extract_generic_args("PhantomData", &field.ty).is_none())
        .map(|field| {
            let ident = field.ident.as_ref().unwrap();
            let ty = &field.ty;
            let Some(_) = extract_generic_args("StructField", ty) else {
                abort!(field, "Only StructField and PhantomData are allowed")
            };
            let attrs = &field.attrs;
            let Some(value_type_attr) =
                attrs.iter().find(|attr| attr.path().is_ident("value_type"))
            else {
                abort!(field, "Expected #[value_type(...)] attribute for field");
            };
            let Ok(value_type_expr) = value_type_attr.parse_args::<Expr>() else {
                abort!(value_type_attr, "Expected expression in #[value_type(...)]");
            };
            let value_expr_toks = normalize_value_expr(&value_type_expr);
            (ident.clone(), value_expr_toks)
        })
        .collect::<Vec<_>>();
    // `<*>::new` impl of `StructField` and `PhantomData` for `StructFields::new`
    let phantoms_create = phantom_info
        .iter()
        .map(|id| quote! { #id: ::std::marker::PhantomData })
        .collect::<Vec<_>>();
    let fields_create = field_info
        .iter()
        .map(|(id, ty)| {
            let id_lit = LitStr::new(&id.to_string(), id.span());
            quote! {
                #id: ::nac3core::codegen::types::structure::StructField::create(
                    &mut counter,
                    #id_lit,
                    #ty,
                )
            }
        })
        .collect::<Vec<_>>();
    // `.into()` impl of `StructField` for `StructFields::to_vec`
    let fields_into =
        field_info.iter().map(|(id, _)| quote! { self.#id.into() }).collect::<Vec<_>>();
    let impl_block = quote! {
        impl<'ctx> ::nac3core::codegen::types::structure::StructFields<'ctx> for #ident<'ctx> {
            fn new(ctx: impl ::nac3core::inkwell::context::AsContextRef<'ctx>, llvm_usize: ::nac3core::inkwell::types::IntType<'ctx>) -> Self {
                let ctx = unsafe { ::nac3core::inkwell::context::ContextRef::new(ctx.as_ctx_ref()) };
                let mut counter = ::nac3core::codegen::types::structure::FieldIndexCounter::default();
                #ident {
                    #(#fields_create),*
                    #(#phantoms_create),*
                }
            }
            fn to_vec(&self) -> ::std::vec::Vec<(&'static str, ::nac3core::inkwell::types::BasicTypeEnum<'ctx>)> {
                vec![
                    #(#fields_into),*
                ]
            }
        }
    };
    impl_block.into()
 }
--- a/nac3core/nac3core_derive/tests/structfields_empty.rs
+++ b/nac3core/nac3core_derive/tests/structfields_empty.rs
@ -1,9 +0,0 @@
 use nac3core_derive::StructFields;
 use std::marker::PhantomData;
 #[derive(PartialEq, Eq, Clone, Copy, StructFields)]
 pub struct EmptyValue<'ctx> {
    _phantom: PhantomData<&'ctx ()>,
 }
 fn main() {}
--- a/nac3core/nac3core_derive/tests/structfields_ndarray.rs
+++ b/nac3core/nac3core_derive/tests/structfields_ndarray.rs
@ -1,20 +0,0 @@
 use nac3core::{
    codegen::types::structure::StructField,
    inkwell::{
        values::{IntValue, PointerValue},
        AddressSpace,
    },
 };
 use nac3core_derive::StructFields;
 #[derive(PartialEq, Eq, Clone, Copy, StructFields)]
 pub struct NDArrayValue<'ctx> {
    #[value_type(usize)]
    ndims: StructField<'ctx, IntValue<'ctx>>,
    #[value_type(usize.ptr_type(AddressSpace::default()))]
    shape: StructField<'ctx, PointerValue<'ctx>>,
    #[value_type(i8_type().ptr_type(AddressSpace::default()))]
    data: StructField<'ctx, PointerValue<'ctx>>,
 }
 fn main() {}
--- a/nac3core/nac3core_derive/tests/structfields_slice.rs
+++ b/nac3core/nac3core_derive/tests/structfields_slice.rs
@ -1,18 +0,0 @@
 use nac3core::{
    codegen::types::structure::StructField,
    inkwell::{
        values::{IntValue, PointerValue},
        AddressSpace,
    },
 };
 use nac3core_derive::StructFields;
 #[derive(PartialEq, Eq, Clone, Copy, StructFields)]
 pub struct SliceValue<'ctx> {
    #[value_type(i8_type().ptr_type(AddressSpace::default()))]
    ptr: StructField<'ctx, PointerValue<'ctx>>,
    #[value_type(usize)]
    len: StructField<'ctx, IntValue<'ctx>>,
 }
 fn main() {}
--- a/nac3core/nac3core_derive/tests/structfields_slice_context.rs
+++ b/nac3core/nac3core_derive/tests/structfields_slice_context.rs
@ -1,18 +0,0 @@
 use nac3core::{
    codegen::types::structure::StructField,
    inkwell::{
        values::{IntValue, PointerValue},
        AddressSpace,
    },
 };
 use nac3core_derive::StructFields;
 #[derive(PartialEq, Eq, Clone, Copy, StructFields)]
 pub struct SliceValue<'ctx> {
    #[value_type(context.i8_type().ptr_type(AddressSpace::default()))]
    ptr: StructField<'ctx, PointerValue<'ctx>>,
    #[value_type(usize)]
    len: StructField<'ctx, IntValue<'ctx>>,
 }
 fn main() {}
--- a/nac3core/nac3core_derive/tests/structfields_slice_ctx.rs
+++ b/nac3core/nac3core_derive/tests/structfields_slice_ctx.rs
@ -1,18 +0,0 @@
 use nac3core::{
    codegen::types::structure::StructField,
    inkwell::{
        values::{IntValue, PointerValue},
        AddressSpace,
    },
 };
 use nac3core_derive::StructFields;
 #[derive(PartialEq, Eq, Clone, Copy, StructFields)]
 pub struct SliceValue<'ctx> {
    #[value_type(ctx.i8_type().ptr_type(AddressSpace::default()))]
    ptr: StructField<'ctx, PointerValue<'ctx>>,
    #[value_type(usize)]
    len: StructField<'ctx, IntValue<'ctx>>,
 }
 fn main() {}
--- a/nac3core/nac3core_derive/tests/structfields_slice_sizet.rs
+++ b/nac3core/nac3core_derive/tests/structfields_slice_sizet.rs
@ -1,18 +0,0 @@
 use nac3core::{
    codegen::types::structure::StructField,
    inkwell::{
        values::{IntValue, PointerValue},
        AddressSpace,
    },
 };
 use nac3core_derive::StructFields;
 #[derive(PartialEq, Eq, Clone, Copy, StructFields)]
 pub struct SliceValue<'ctx> {
    #[value_type(i8_type().ptr_type(AddressSpace::default()))]
    ptr: StructField<'ctx, PointerValue<'ctx>>,
    #[value_type(size_t)]
    len: StructField<'ctx, IntValue<'ctx>>,
 }
 fn main() {}
--- a/nac3core/nac3core_derive/tests/structfields_test.rs
+++ b/nac3core/nac3core_derive/tests/structfields_test.rs
@ -1,10 +0,0 @@
 #[test]
 fn test_parse_empty() {
    let t = trybuild::TestCases::new();
    t.pass("tests/structfields_empty.rs");
    t.pass("tests/structfields_slice.rs");
    t.pass("tests/structfields_slice_ctx.rs");
    t.pass("tests/structfields_slice_context.rs");
    t.pass("tests/structfields_slice_sizet.rs");
    t.pass("tests/structfields_ndarray.rs");
 }
--- a/nac3core/src/codegen/builtin_fns.rs
+++ b/nac3core/src/codegen/builtin_fns.rs
@ -5,26 +5,24 @@ use inkwell::{
 };
 use itertools::Itertools;
 use super::{
    expr::destructure_range,
    extern_fns, irrt,
    irrt::calculate_len_for_slice_range,
    llvm_intrinsics,
    macros::codegen_unreachable,
    numpy,
    numpy::ndarray_elementwise_unaryop_impl,
    stmt::gen_for_callback_incrementing,
    values::{
        ArrayLikeValue, NDArrayValue, ProxyValue, RangeValue, TypedArrayLikeAccessor,
        UntypedArrayLikeAccessor, UntypedArrayLikeMutator,
    },
    CodeGenContext, CodeGenerator,
 };
 use crate::{
-    toplevel::{
+    codegen::{
-        helper::{arraylike_flatten_element_type, PrimDef},
+        classes::{
-        numpy::unpack_ndarray_var_tys,
+            ArrayLikeValue, NDArrayValue, ProxyValue, RangeValue, TypedArrayLikeAccessor,
            UntypedArrayLikeAccessor, UntypedArrayLikeMutator,
        },
        expr::destructure_range,
        extern_fns, irrt,
        irrt::calculate_len_for_slice_range,
        llvm_intrinsics,
        macros::codegen_unreachable,
        numpy,
        numpy::ndarray_elementwise_unaryop_impl,
        stmt::gen_for_callback_incrementing,
        CodeGenContext, CodeGenerator,
    },
    toplevel::helper::PrimDef,
    toplevel::numpy::unpack_ndarray_var_tys,
    typecheck::typedef::{Type, TypeEnum},
 };
@ -50,7 +48,7 @@ pub fn call_len<'ctx, G: CodeGenerator + ?Sized>(
    let (arg_ty, arg) = n;
    Ok(if ctx.unifier.unioned(arg_ty, range_ty) {
-        let arg = RangeValue::from_pointer_value(arg.into_pointer_value(), Some("range"));
+        let arg = RangeValue::from_ptr_val(arg.into_pointer_value(), Some("range"));
        let (start, end, step) = destructure_range(ctx, arg);
        calculate_len_for_slice_range(generator, ctx, start, end, step)
    } else {
@ -68,17 +66,11 @@ pub fn call_len<'ctx, G: CodeGenerator + ?Sized>(
                ctx.builder.build_int_truncate_or_bit_cast(len, llvm_i32, "len").unwrap()
            }
            TypeEnum::TObj { obj_id, .. } if *obj_id == PrimDef::NDArray.id() => {
                let elem_ty = arraylike_flatten_element_type(&mut ctx.unifier, arg_ty);
                let llvm_usize = generator.get_size_type(ctx.ctx);
-                let arg = NDArrayValue::from_pointer_value(
+                let arg = NDArrayValue::from_ptr_val(arg.into_pointer_value(), llvm_usize, None);
                    arg.into_pointer_value(),
                    ctx.get_llvm_type(generator, elem_ty),
                    llvm_usize,
                    None,
                );
-                let ndims = arg.shape().size(ctx, generator);
+                let ndims = arg.dim_sizes().size(ctx, generator);
                ctx.make_assert(
                    generator,
                    ctx.builder
@ -91,7 +83,12 @@ pub fn call_len<'ctx, G: CodeGenerator + ?Sized>(
                );
                let len = unsafe {
-                    arg.shape().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
+                    arg.dim_sizes().get_typed_unchecked(
                        ctx,
                        generator,
                        &llvm_usize.const_zero(),
                        None,
                    )
                };
                ctx.builder.build_int_truncate_or_bit_cast(len, llvm_i32, "len").unwrap()
@ -146,14 +143,13 @@ pub fn call_int32<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ctx.primitives.int32,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_int32(generator, ctx, (elem_ty, val)),
            )?;
@ -209,14 +205,13 @@ pub fn call_int64<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ctx.primitives.int64,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_int64(generator, ctx, (elem_ty, val)),
            )?;
@ -288,14 +283,13 @@ pub fn call_uint32<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ctx.primitives.uint32,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_uint32(generator, ctx, (elem_ty, val)),
            )?;
@ -356,14 +350,13 @@ pub fn call_uint64<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ctx.primitives.uint64,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_uint64(generator, ctx, (elem_ty, val)),
            )?;
@ -423,14 +416,13 @@ pub fn call_float<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ctx.primitives.float,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_float(generator, ctx, (elem_ty, val)),
            )?;
@ -470,14 +462,13 @@ pub fn call_round<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ret_elem_ty,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_round(generator, ctx, (elem_ty, val), ret_elem_ty),
            )?;
@ -511,14 +502,13 @@ pub fn call_numpy_round<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ctx.primitives.float,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_numpy_round(generator, ctx, (elem_ty, val)),
            )?;
@ -577,14 +567,13 @@ pub fn call_bool<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ctx.primitives.bool,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| {
                    let elem = call_bool(generator, ctx, (elem_ty, val))?;
@ -632,14 +621,13 @@ pub fn call_floor<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ret_elem_ty,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_floor(generator, ctx, (elem_ty, val), ret_elem_ty),
            )?;
@ -683,14 +671,13 @@ pub fn call_ceil<'ctx, G: CodeGenerator + ?Sized>(
            if n_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, n_ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
                generator,
                ctx,
                ret_elem_ty,
                None,
-                NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(n, llvm_usize, None),
                |generator, ctx, val| call_ceil(generator, ctx, (elem_ty, val), ret_elem_ty),
            )?;
@ -819,8 +806,8 @@ pub fn call_numpy_minimum<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_minimum(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -919,10 +906,10 @@ pub fn call_numpy_max_min<'ctx, G: CodeGenerator + ?Sized>(
            if a_ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) =>
        {
            let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, a_ty);
-            let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
+            let llvm_ndarray_ty = ctx.get_llvm_type(generator, elem_ty);
-            let n = NDArrayValue::from_pointer_value(n, llvm_elem_ty, llvm_usize, None);
+            let n = NDArrayValue::from_ptr_val(n, llvm_usize, None);
-            let n_sz = irrt::call_ndarray_calc_size(generator, ctx, &n.shape(), (None, None));
+            let n_sz = irrt::call_ndarray_calc_size(generator, ctx, &n.dim_sizes(), (None, None));
            if ctx.registry.llvm_options.opt_level == OptimizationLevel::None {
                let n_sz_eqz = ctx
                    .builder
@ -939,7 +926,7 @@ pub fn call_numpy_max_min<'ctx, G: CodeGenerator + ?Sized>(
                );
            }
-            let accumulator_addr = generator.gen_var_alloc(ctx, llvm_elem_ty, None)?;
+            let accumulator_addr = generator.gen_var_alloc(ctx, llvm_ndarray_ty, None)?;
            let res_idx = generator.gen_var_alloc(ctx, llvm_int64.into(), None)?;
            unsafe {
@ -1081,8 +1068,8 @@ pub fn call_numpy_maximum<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_maximum(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -1127,7 +1114,6 @@ where
        {
            let llvm_usize = generator.get_size_type(ctx.ctx);
            let (arg_elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, arg_ty);
            let llvm_arg_elem_ty = ctx.get_llvm_type(generator, arg_elem_ty);
            let ret_elem_ty = get_ret_elem_type(ctx, arg_elem_ty);
            let ndarray = ndarray_elementwise_unaryop_impl(
@ -1135,7 +1121,7 @@ where
                ctx,
                ret_elem_ty,
                None,
-                NDArrayValue::from_pointer_value(x, llvm_arg_elem_ty, llvm_usize, None),
+                NDArrayValue::from_ptr_val(x, llvm_usize, None),
                |generator, ctx, elem_val| {
                    helper_call_numpy_unary_elementwise(
                        generator,
@ -1522,8 +1508,8 @@ pub fn call_numpy_arctan2<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_arctan2(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -1589,8 +1575,8 @@ pub fn call_numpy_copysign<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_copysign(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -1656,8 +1642,8 @@ pub fn call_numpy_fmax<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_fmax(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -1723,8 +1709,8 @@ pub fn call_numpy_fmin<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_fmin(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -1779,8 +1765,8 @@ pub fn call_numpy_ldexp<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_ldexp(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -1846,8 +1832,8 @@ pub fn call_numpy_hypot<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_hypot(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -1913,8 +1899,8 @@ pub fn call_numpy_nextafter<'ctx, G: CodeGenerator + ?Sized>(
                ctx,
                dtype,
                None,
-                (x1_ty, x1, !is_ndarray1),
+                (x1, !is_ndarray1),
-                (x2_ty, x2, !is_ndarray2),
+                (x2, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    call_numpy_nextafter(generator, ctx, (x1_scalar_ty, lhs), (x2_scalar_ty, rhs))
                },
@ -1974,14 +1960,14 @@ pub fn call_np_linalg_cholesky<'ctx, G: CodeGenerator + ?Sized>(
            unsupported_type(ctx, FN_NAME, &[x1_ty]);
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        let dim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
        let dim1 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_int(1, false), None)
                .into_int_value()
        };
@ -2016,14 +2002,14 @@ pub fn call_np_linalg_qr<'ctx, G: CodeGenerator + ?Sized>(
            unimplemented!("{FN_NAME} operates on float type NdArrays only");
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        let dim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
        let dim1 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_int(1, false), None)
                .into_int_value()
        };
@ -2066,15 +2052,15 @@ pub fn call_np_linalg_svd<'ctx, G: CodeGenerator + ?Sized>(
            unsupported_type(ctx, FN_NAME, &[x1_ty]);
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        let dim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
        let dim1 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_int(1, false), None)
                .into_int_value()
        };
@ -2121,14 +2107,14 @@ pub fn call_np_linalg_inv<'ctx, G: CodeGenerator + ?Sized>(
            unsupported_type(ctx, FN_NAME, &[x1_ty]);
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        let dim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
        let dim1 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_int(1, false), None)
                .into_int_value()
        };
@ -2163,15 +2149,15 @@ pub fn call_np_linalg_pinv<'ctx, G: CodeGenerator + ?Sized>(
            unsupported_type(ctx, FN_NAME, &[x1_ty]);
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        let dim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
        let dim1 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_int(1, false), None)
                .into_int_value()
        };
@ -2206,15 +2192,15 @@ pub fn call_sp_linalg_lu<'ctx, G: CodeGenerator + ?Sized>(
            unsupported_type(ctx, FN_NAME, &[x1_ty]);
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        let dim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
        let dim1 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_int(1, false), None)
                .into_int_value()
        };
@ -2259,7 +2245,7 @@ pub fn call_np_linalg_matrix_power<'ctx, G: CodeGenerator + ?Sized>(
            unsupported_type(ctx, FN_NAME, &[x1_ty, x2_ty]);
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        // Changing second parameter to a `NDArray` for uniformity in function call
        let n2_array = numpy::create_ndarray_const_shape(
            generator,
@ -2279,12 +2265,12 @@ pub fn call_np_linalg_matrix_power<'ctx, G: CodeGenerator + ?Sized>(
        let n2_array = n2_array.as_base_value().as_basic_value_enum();
        let outdim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
        let outdim1 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_int(1, false), None)
                .into_int_value()
        };
@ -2354,10 +2340,10 @@ pub fn call_sp_linalg_schur<'ctx, G: CodeGenerator + ?Sized>(
            unsupported_type(ctx, FN_NAME, &[x1_ty]);
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        let dim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
@ -2397,10 +2383,10 @@ pub fn call_sp_linalg_hessenberg<'ctx, G: CodeGenerator + ?Sized>(
            unsupported_type(ctx, FN_NAME, &[x1_ty]);
        };
-        let n1 = NDArrayValue::from_pointer_value(n1, n1_elem_ty, llvm_usize, None);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
        let dim0 = unsafe {
-            n1.shape()
+            n1.dim_sizes()
                .get_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
                .into_int_value()
        };
--- a/nac3core/src/codegen/classes.rs
+++ b/nac3core/src/codegen/classes.rs
--- a/nac3core/src/codegen/expr.rs
+++ b/nac3core/src/codegen/expr.rs
@ -18,28 +18,27 @@ use nac3parser::ast::{
    Unaryop,
 };
 use super::{
    concrete_type::{ConcreteFuncArg, ConcreteTypeEnum, ConcreteTypeStore},
    gen_in_range_check, get_llvm_abi_type, get_llvm_type, get_va_count_arg_name,
    irrt::*,
    llvm_intrinsics::{
        call_expect, call_float_floor, call_float_pow, call_float_powi, call_int_smax,
        call_int_umin, call_memcpy_generic,
    },
    macros::codegen_unreachable,
    need_sret, numpy,
    stmt::{
        gen_for_callback_incrementing, gen_if_callback, gen_if_else_expr_callback, gen_raise,
        gen_var,
    },
    types::{ListType, ProxyType},
    values::{
        ArrayLikeIndexer, ArrayLikeValue, ListValue, NDArrayValue, ProxyValue, RangeValue,
        TypedArrayLikeAccessor, UntypedArrayLikeAccessor,
    },
    CodeGenContext, CodeGenTask, CodeGenerator,
 };
 use crate::{
    codegen::{
        classes::{
            ArrayLikeIndexer, ArrayLikeValue, ListType, ListValue, NDArrayValue, ProxyType,
            ProxyValue, RangeValue, TypedArrayLikeAccessor, UntypedArrayLikeAccessor,
        },
        concrete_type::{ConcreteFuncArg, ConcreteTypeEnum, ConcreteTypeStore},
        gen_in_range_check, get_llvm_abi_type, get_llvm_type, get_va_count_arg_name,
        irrt::*,
        llvm_intrinsics::{
            call_expect, call_float_floor, call_float_pow, call_float_powi, call_int_smax,
            call_int_umin, call_memcpy_generic,
        },
        macros::codegen_unreachable,
        need_sret, numpy,
        stmt::{
            gen_for_callback_incrementing, gen_if_callback, gen_if_else_expr_callback, gen_raise,
            gen_var,
        },
        CodeGenContext, CodeGenTask, CodeGenerator,
    },
    symbol_resolver::{SymbolValue, ValueEnum},
    toplevel::{
        helper::PrimDef,
@ -1168,8 +1167,7 @@ pub fn gen_comprehension<'ctx, G: CodeGenerator>(
        TypeEnum::TObj { obj_id, .. }
            if *obj_id == ctx.primitives.range.obj_id(&ctx.unifier).unwrap() =>
        {
-            let iter_val =
+            let iter_val = RangeValue::from_ptr_val(iter_val.into_pointer_value(), Some("range"));
                RangeValue::from_pointer_value(iter_val.into_pointer_value(), Some("range"));
            let (start, stop, step) = destructure_range(ctx, iter_val);
            let diff = ctx.builder.build_int_sub(stop, start, "diff").unwrap();
            // add 1 to the length as the value is rounded to zero
@ -1400,10 +1398,8 @@ pub fn gen_binop_expr_with_values<'ctx, G: CodeGenerator>(
                let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty1);
                let sizeof_elem = llvm_elem_ty.size_of().unwrap();
-                let lhs =
+                let lhs = ListValue::from_ptr_val(left_val.into_pointer_value(), llvm_usize, None);
-                    ListValue::from_pointer_value(left_val.into_pointer_value(), llvm_usize, None);
+                let rhs = ListValue::from_ptr_val(right_val.into_pointer_value(), llvm_usize, None);
                let rhs =
                    ListValue::from_pointer_value(right_val.into_pointer_value(), llvm_usize, None);
                let size = ctx
                    .builder
@ -1486,7 +1482,7 @@ pub fn gen_binop_expr_with_values<'ctx, G: CodeGenerator>(
                        codegen_unreachable!(ctx)
                    };
                let list_val =
-                    ListValue::from_pointer_value(list_val.into_pointer_value(), llvm_usize, None);
+                    ListValue::from_ptr_val(list_val.into_pointer_value(), llvm_usize, None);
                let int_val = ctx
                    .builder
                    .build_int_s_extend(int_val.into_int_value(), llvm_usize, "")
@ -1564,21 +1560,10 @@ pub fn gen_binop_expr_with_values<'ctx, G: CodeGenerator>(
            assert!(ctx.unifier.unioned(ndarray_dtype1, ndarray_dtype2));
-            let llvm_ndarray_dtype1 = ctx.get_llvm_type(generator, ndarray_dtype1);
+            let left_val =
-            let llvm_ndarray_dtype2 = ctx.get_llvm_type(generator, ndarray_dtype2);
+                NDArrayValue::from_ptr_val(left_val.into_pointer_value(), llvm_usize, None);
-
+            let right_val =
-            let left_val = NDArrayValue::from_pointer_value(
+                NDArrayValue::from_ptr_val(right_val.into_pointer_value(), llvm_usize, None);
                left_val.into_pointer_value(),
                llvm_ndarray_dtype1,
                llvm_usize,
                None,
            );
            let right_val = NDArrayValue::from_pointer_value(
                right_val.into_pointer_value(),
                llvm_ndarray_dtype2,
                llvm_usize,
                None,
            );
            let res = if op.base == Operator::MatMult {
                // MatMult is the only binop which is not an elementwise op
@ -1602,8 +1587,8 @@ pub fn gen_binop_expr_with_values<'ctx, G: CodeGenerator>(
                        BinopVariant::Normal => None,
                        BinopVariant::AugAssign => Some(left_val),
                    },
-                    (ty1, left_val.as_base_value().into(), false),
+                    (left_val.as_base_value().into(), false),
-                    (ty2, right_val.as_base_value().into(), false),
+                    (right_val.as_base_value().into(), false),
                    |generator, ctx, (lhs, rhs)| {
                        gen_binop_expr_with_values(
                            generator,
@ -1627,10 +1612,8 @@ pub fn gen_binop_expr_with_values<'ctx, G: CodeGenerator>(
        } else {
            let (ndarray_dtype, _) =
                unpack_ndarray_var_tys(&mut ctx.unifier, if is_ndarray1 { ty1 } else { ty2 });
-            let llvm_ndarray_dtype = ctx.get_llvm_type(generator, ndarray_dtype);
+            let ndarray_val = NDArrayValue::from_ptr_val(
            let ndarray_val = NDArrayValue::from_pointer_value(
                if is_ndarray1 { left_val } else { right_val }.into_pointer_value(),
                llvm_ndarray_dtype,
                llvm_usize,
                None,
            );
@ -1642,8 +1625,8 @@ pub fn gen_binop_expr_with_values<'ctx, G: CodeGenerator>(
                    BinopVariant::Normal => None,
                    BinopVariant::AugAssign => Some(ndarray_val),
                },
-                (ty1, left_val, !is_ndarray1),
+                (left_val, !is_ndarray1),
-                (ty2, right_val, !is_ndarray2),
+                (right_val, !is_ndarray2),
                |generator, ctx, (lhs, rhs)| {
                    gen_binop_expr_with_values(
                        generator,
@ -1794,12 +1777,7 @@ pub fn gen_unaryop_expr_with_values<'ctx, G: CodeGenerator>(
            ast::Unaryop::Invert => ctx.builder.build_not(val, "not").map(Into::into).unwrap(),
            ast::Unaryop::Not => ctx
                .builder
-                .build_int_compare(
+                .build_xor(val, val.get_type().const_all_ones(), "not")
                    inkwell::IntPredicate::EQ,
                    val,
                    val.get_type().const_zero(),
                    "not",
                )
                .map(Into::into)
                .unwrap(),
            ast::Unaryop::UAdd => val.into(),
@ -1823,14 +1801,8 @@ pub fn gen_unaryop_expr_with_values<'ctx, G: CodeGenerator>(
    } else if ty.obj_id(&ctx.unifier).is_some_and(|id| id == PrimDef::NDArray.id()) {
        let llvm_usize = generator.get_size_type(ctx.ctx);
        let (ndarray_dtype, _) = unpack_ndarray_var_tys(&mut ctx.unifier, ty);
        let llvm_ndarray_dtype = ctx.get_llvm_type(generator, ndarray_dtype);
-        let val = NDArrayValue::from_pointer_value(
+        let val = NDArrayValue::from_ptr_val(val.into_pointer_value(), llvm_usize, None);
            val.into_pointer_value(),
            llvm_ndarray_dtype,
            llvm_usize,
            None,
        );
        // ndarray uses `~` rather than `not` to perform elementwise inversion, convert it before
        // passing it to the elementwise codegen function
@ -1921,21 +1893,15 @@ pub fn gen_cmpop_expr_with_values<'ctx, G: CodeGenerator>(
                assert!(ctx.unifier.unioned(ndarray_dtype1, ndarray_dtype2));
-                let llvm_ndarray_dtype1 = ctx.get_llvm_type(generator, ndarray_dtype1);
+                let left_val =
-
+                    NDArrayValue::from_ptr_val(lhs.into_pointer_value(), llvm_usize, None);
                let left_val = NDArrayValue::from_pointer_value(
                    lhs.into_pointer_value(),
                    llvm_ndarray_dtype1,
                    llvm_usize,
                    None,
                );
                let res = numpy::ndarray_elementwise_binop_impl(
                    generator,
                    ctx,
                    ctx.primitives.bool,
                    None,
-                    (left_ty, left_val.as_base_value().into(), false),
+                    (left_val.as_base_value().into(), false),
-                    (right_ty, rhs, false),
+                    (rhs, false),
                    |generator, ctx, (lhs, rhs)| {
                        let val = gen_cmpop_expr_with_values(
                            generator,
@ -1966,8 +1932,8 @@ pub fn gen_cmpop_expr_with_values<'ctx, G: CodeGenerator>(
                    ctx,
                    ctx.primitives.bool,
                    None,
-                    (left_ty, lhs, !is_ndarray1),
+                    (lhs, !is_ndarray1),
-                    (right_ty, rhs, !is_ndarray2),
+                    (rhs, !is_ndarray2),
                    |generator, ctx, (lhs, rhs)| {
                        let val = gen_cmpop_expr_with_values(
                            generator,
@ -2230,9 +2196,9 @@ pub fn gen_cmpop_expr_with_values<'ctx, G: CodeGenerator>(
                    }
                    let left_val =
-                        ListValue::from_pointer_value(lhs.into_pointer_value(), llvm_usize, None);
+                        ListValue::from_ptr_val(lhs.into_pointer_value(), llvm_usize, None);
                    let right_val =
-                        ListValue::from_pointer_value(rhs.into_pointer_value(), llvm_usize, None);
+                        ListValue::from_ptr_val(rhs.into_pointer_value(), llvm_usize, None);
                    Ok(gen_if_else_expr_callback(
                        generator,
@ -2631,7 +2597,7 @@ fn gen_ndarray_subscript_expr<'ctx, G: CodeGenerator>(
                let llvm_i32 = ctx.ctx.i32_type();
                let len = unsafe {
-                    v.shape().get_typed_unchecked(
+                    v.dim_sizes().get_typed_unchecked(
                        ctx,
                        generator,
                        &llvm_usize.const_int(dim, true),
@ -2672,7 +2638,7 @@ fn gen_ndarray_subscript_expr<'ctx, G: CodeGenerator>(
            ExprKind::Slice { lower, upper, step } => {
                let dim_sz = unsafe {
-                    v.shape().get_typed_unchecked(
+                    v.dim_sizes().get_typed_unchecked(
                        ctx,
                        generator,
                        &llvm_usize.const_int(dim, false),
@ -2796,12 +2762,7 @@ fn gen_ndarray_subscript_expr<'ctx, G: CodeGenerator>(
                // elements over
                let subscripted_ndarray =
                    generator.gen_var_alloc(ctx, llvm_ndarray_t.into(), None)?;
-                let ndarray = NDArrayValue::from_pointer_value(
+                let ndarray = NDArrayValue::from_ptr_val(subscripted_ndarray, llvm_usize, None);
                    subscripted_ndarray,
                    llvm_ndarray_data_t,
                    llvm_usize,
                    None,
                );
                let num_dims = v.load_ndims(ctx);
                ndarray.store_ndims(
@ -2813,7 +2774,7 @@ fn gen_ndarray_subscript_expr<'ctx, G: CodeGenerator>(
                );
                let ndarray_num_dims = ndarray.load_ndims(ctx);
-                ndarray.create_shape(ctx, llvm_usize, ndarray_num_dims);
+                ndarray.create_dim_sizes(ctx, llvm_usize, ndarray_num_dims);
                let ndarray_num_dims = ctx
                    .builder
@ -2824,7 +2785,7 @@ fn gen_ndarray_subscript_expr<'ctx, G: CodeGenerator>(
                    )
                    .unwrap();
                let v_dims_src_ptr = unsafe {
-                    v.shape().ptr_offset_unchecked(
+                    v.dim_sizes().ptr_offset_unchecked(
                        ctx,
                        generator,
                        &llvm_usize.const_int(1, false),
@ -2833,7 +2794,7 @@ fn gen_ndarray_subscript_expr<'ctx, G: CodeGenerator>(
                };
                call_memcpy_generic(
                    ctx,
-                    ndarray.shape().base_ptr(ctx, generator),
+                    ndarray.dim_sizes().base_ptr(ctx, generator),
                    v_dims_src_ptr,
                    ctx.builder
                        .build_int_mul(ndarray_num_dims, llvm_usize.size_of(), "")
@ -2845,7 +2806,7 @@ fn gen_ndarray_subscript_expr<'ctx, G: CodeGenerator>(
                let ndarray_num_elems = call_ndarray_calc_size(
                    generator,
                    ctx,
-                    &ndarray.shape().as_slice_value(ctx, generator),
+                    &ndarray.dim_sizes().as_slice_value(ctx, generator),
                    (None, None),
                );
                let ndarray_num_elems = ctx
@ -2925,31 +2886,7 @@ pub fn gen_expr<'ctx, G: CodeGenerator>(
            Some((_, Some(static_value), _)) => ValueEnum::Static(static_value.clone()),
            None => {
                let resolver = ctx.resolver.clone();
-                let value = resolver.get_symbol_value(*id, ctx, generator).unwrap();
+                resolver.get_symbol_value(*id, ctx, generator).unwrap()
                let globals = ctx
                    .top_level
                    .definitions
                    .read()
                    .iter()
                    .filter_map(|def| {
                        if let TopLevelDef::Variable { simple_name, ty, .. } = &*def.read() {
                            Some((*simple_name, *ty))
                        } else {
                            None
                        }
                    })
                    .collect_vec();
                if let Some((_, ty)) = globals.iter().find(|(name, _)| name == id) {
                    let ptr = value
                        .to_basic_value_enum(ctx, generator, *ty)
                        .map(BasicValueEnum::into_pointer_value)?;
                    ctx.builder.build_load(ptr, id.to_string().as_str()).map(Into::into).unwrap()
                } else {
                    value
                }
            }
        },
        ExprKind::List { elts, .. } => {
@ -3142,53 +3079,48 @@ pub fn gen_expr<'ctx, G: CodeGenerator>(
            };
            let left = generator.bool_to_i1(ctx, left);
            let current = ctx.builder.get_insert_block().unwrap().get_parent().unwrap();
-            let a_begin_bb = ctx.ctx.append_basic_block(current, "a_begin");
+            let a_bb = ctx.ctx.append_basic_block(current, "a");
-            let a_end_bb = ctx.ctx.append_basic_block(current, "a_end");
+            let b_bb = ctx.ctx.append_basic_block(current, "b");
            let b_begin_bb = ctx.ctx.append_basic_block(current, "b_begin");
            let b_end_bb = ctx.ctx.append_basic_block(current, "b_end");
            let cont_bb = ctx.ctx.append_basic_block(current, "cont");
-            ctx.builder.build_conditional_branch(left, a_begin_bb, b_begin_bb).unwrap();
+            ctx.builder.build_conditional_branch(left, a_bb, b_bb).unwrap();
            ctx.builder.position_at_end(a_end_bb);
            ctx.builder.build_unconditional_branch(cont_bb).unwrap();
            ctx.builder.position_at_end(b_end_bb);
            ctx.builder.build_unconditional_branch(cont_bb).unwrap();
            let (a, b) = match op {
                Boolop::Or => {
-                    ctx.builder.position_at_end(a_begin_bb);
+                    ctx.builder.position_at_end(a_bb);
                    let a = ctx.ctx.i8_type().const_int(1, false);
-                    ctx.builder.build_unconditional_branch(a_end_bb).unwrap();
+                    ctx.builder.build_unconditional_branch(cont_bb).unwrap();
-                    ctx.builder.position_at_end(b_begin_bb);
+                    ctx.builder.position_at_end(b_bb);
                    let b = if let Some(v) = generator.gen_expr(ctx, &values[1])? {
                        let b = v
                            .to_basic_value_enum(ctx, generator, values[1].custom.unwrap())?
                            .into_int_value();
                        let b = generator.bool_to_i8(ctx, b);
                        ctx.builder.build_unconditional_branch(cont_bb).unwrap();
                        Some(b)
                    } else {
                        None
                    };
                    ctx.builder.build_unconditional_branch(b_end_bb).unwrap();
                    (Some(a), b)
                }
                Boolop::And => {
-                    ctx.builder.position_at_end(a_begin_bb);
+                    ctx.builder.position_at_end(a_bb);
                    let a = if let Some(v) = generator.gen_expr(ctx, &values[1])? {
                        let a = v
                            .to_basic_value_enum(ctx, generator, values[1].custom.unwrap())?
                            .into_int_value();
                        let a = generator.bool_to_i8(ctx, a);
                        ctx.builder.build_unconditional_branch(cont_bb).unwrap();
                        Some(a)
                    } else {
                        None
                    };
                    ctx.builder.build_unconditional_branch(a_end_bb).unwrap();
-                    ctx.builder.position_at_end(b_begin_bb);
+                    ctx.builder.position_at_end(b_bb);
                    let b = ctx.ctx.i8_type().const_zero();
-                    ctx.builder.build_unconditional_branch(b_end_bb).unwrap();
+                    ctx.builder.build_unconditional_branch(cont_bb).unwrap();
                    (a, Some(b))
                }
@ -3198,7 +3130,7 @@ pub fn gen_expr<'ctx, G: CodeGenerator>(
            match (a, b) {
                (Some(a), Some(b)) => {
                    let phi = ctx.builder.build_phi(ctx.ctx.i8_type(), "").unwrap();
-                    phi.add_incoming(&[(&a, a_end_bb), (&b, b_end_bb)]);
+                    phi.add_incoming(&[(&a, a_bb), (&b, b_bb)]);
                    phi.as_basic_value().into()
                }
                (Some(a), None) => a.into(),
@ -3436,7 +3368,7 @@ pub fn gen_expr<'ctx, G: CodeGenerator>(
                    } else {
                        return Ok(None);
                    };
-                    let v = ListValue::from_pointer_value(v, usize, Some("arr"));
+                    let v = ListValue::from_ptr_val(v, usize, Some("arr"));
                    let ty = ctx.get_llvm_type(generator, *ty);
                    if let ExprKind::Slice { lower, upper, step } = &slice.node {
                        let one = int32.const_int(1, false);
@ -3539,7 +3471,6 @@ pub fn gen_expr<'ctx, G: CodeGenerator>(
                }
                TypeEnum::TObj { obj_id, params, .. } if *obj_id == PrimDef::NDArray.id() => {
                    let (ty, ndims) = params.iter().map(|(_, ty)| ty).collect_tuple().unwrap();
                    let llvm_ty = ctx.get_llvm_type(generator, *ty);
                    let v = if let Some(v) = generator.gen_expr(ctx, value)? {
                        v.to_basic_value_enum(ctx, generator, value.custom.unwrap())?
@ -3547,7 +3478,7 @@ pub fn gen_expr<'ctx, G: CodeGenerator>(
                    } else {
                        return Ok(None);
                    };
-                    let v = NDArrayValue::from_pointer_value(v, llvm_ty, usize, None);
+                    let v = NDArrayValue::from_ptr_val(v, usize, None);
                    return gen_ndarray_subscript_expr(generator, ctx, *ty, *ndims, v, slice);
                }
--- a/nac3core/src/codegen/extern_fns.rs
+++ b/nac3core/src/codegen/extern_fns.rs
@ -4,7 +4,7 @@ use inkwell::{
 };
 use itertools::Either;
-use super::CodeGenContext;
+use crate::codegen::CodeGenContext;
 /// Macro to generate extern function
 /// Both function return type and function parameter type are `FloatValue`
--- a/nac3core/src/codegen/generator.rs
+++ b/nac3core/src/codegen/generator.rs
@ -6,8 +6,8 @@ use inkwell::{
 use nac3parser::ast::{Expr, Stmt, StrRef};
 use super::{bool_to_i1, bool_to_i8, expr::*, stmt::*, values::ArraySliceValue, CodeGenContext};
 use crate::{
    codegen::{bool_to_i1, bool_to_i8, classes::ArraySliceValue, expr::*, stmt::*, CodeGenContext},
    symbol_resolver::ValueEnum,
    toplevel::{DefinitionId, TopLevelDef},
    typecheck::typedef::{FunSignature, Type},
--- a/nac3core/src/codegen/irrt/list.rs
+++ b/nac3core/src/codegen/irrt/list.rs
@ -1,162 +0,0 @@
 use inkwell::{
    types::BasicTypeEnum,
    values::{BasicValueEnum, CallSiteValue, IntValue},
    AddressSpace, IntPredicate,
 };
 use itertools::Either;
 use super::calculate_len_for_slice_range;
 use crate::codegen::{
    macros::codegen_unreachable,
    values::{ArrayLikeValue, ListValue},
    CodeGenContext, CodeGenerator,
 };
 /// This function handles 'end' **inclusively**.
 /// Order of tuples `assign_idx` and `value_idx` is ('start', 'end', 'step').
 /// Negative index should be handled before entering this function
 pub fn list_slice_assignment<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    ty: BasicTypeEnum<'ctx>,
    dest_arr: ListValue<'ctx>,
    dest_idx: (IntValue<'ctx>, IntValue<'ctx>, IntValue<'ctx>),
    src_arr: ListValue<'ctx>,
    src_idx: (IntValue<'ctx>, IntValue<'ctx>, IntValue<'ctx>),
 ) {
    let size_ty = generator.get_size_type(ctx.ctx);
    let int8_ptr = ctx.ctx.i8_type().ptr_type(AddressSpace::default());
    let int32 = ctx.ctx.i32_type();
    let (fun_symbol, elem_ptr_type) = ("__nac3_list_slice_assign_var_size", int8_ptr);
    let slice_assign_fun = {
        let ty_vec = vec![
            int32.into(),         // dest start idx
            int32.into(),         // dest end idx
            int32.into(),         // dest step
            elem_ptr_type.into(), // dest arr ptr
            int32.into(),         // dest arr len
            int32.into(),         // src start idx
            int32.into(),         // src end idx
            int32.into(),         // src step
            elem_ptr_type.into(), // src arr ptr
            int32.into(),         // src arr len
            int32.into(),         // size
        ];
        ctx.module.get_function(fun_symbol).unwrap_or_else(|| {
            let fn_t = int32.fn_type(ty_vec.as_slice(), false);
            ctx.module.add_function(fun_symbol, fn_t, None)
        })
    };
    let zero = int32.const_zero();
    let one = int32.const_int(1, false);
    let dest_arr_ptr = dest_arr.data().base_ptr(ctx, generator);
    let dest_arr_ptr =
        ctx.builder.build_pointer_cast(dest_arr_ptr, elem_ptr_type, "dest_arr_ptr_cast").unwrap();
    let dest_len = dest_arr.load_size(ctx, Some("dest.len"));
    let dest_len = ctx.builder.build_int_truncate_or_bit_cast(dest_len, int32, "srclen32").unwrap();
    let src_arr_ptr = src_arr.data().base_ptr(ctx, generator);
    let src_arr_ptr =
        ctx.builder.build_pointer_cast(src_arr_ptr, elem_ptr_type, "src_arr_ptr_cast").unwrap();
    let src_len = src_arr.load_size(ctx, Some("src.len"));
    let src_len = ctx.builder.build_int_truncate_or_bit_cast(src_len, int32, "srclen32").unwrap();
    // index in bound and positive should be done
    // assert if dest.step == 1 then len(src) <= len(dest) else len(src) == len(dest), and
    // throw exception if not satisfied
    let src_end = ctx
        .builder
        .build_select(
            ctx.builder.build_int_compare(IntPredicate::SLT, src_idx.2, zero, "is_neg").unwrap(),
            ctx.builder.build_int_sub(src_idx.1, one, "e_min_one").unwrap(),
            ctx.builder.build_int_add(src_idx.1, one, "e_add_one").unwrap(),
            "final_e",
        )
        .map(BasicValueEnum::into_int_value)
        .unwrap();
    let dest_end = ctx
        .builder
        .build_select(
            ctx.builder.build_int_compare(IntPredicate::SLT, dest_idx.2, zero, "is_neg").unwrap(),
            ctx.builder.build_int_sub(dest_idx.1, one, "e_min_one").unwrap(),
            ctx.builder.build_int_add(dest_idx.1, one, "e_add_one").unwrap(),
            "final_e",
        )
        .map(BasicValueEnum::into_int_value)
        .unwrap();
    let src_slice_len =
        calculate_len_for_slice_range(generator, ctx, src_idx.0, src_end, src_idx.2);
    let dest_slice_len =
        calculate_len_for_slice_range(generator, ctx, dest_idx.0, dest_end, dest_idx.2);
    let src_eq_dest = ctx
        .builder
        .build_int_compare(IntPredicate::EQ, src_slice_len, dest_slice_len, "slice_src_eq_dest")
        .unwrap();
    let src_slt_dest = ctx
        .builder
        .build_int_compare(IntPredicate::SLT, src_slice_len, dest_slice_len, "slice_src_slt_dest")
        .unwrap();
    let dest_step_eq_one = ctx
        .builder
        .build_int_compare(
            IntPredicate::EQ,
            dest_idx.2,
            dest_idx.2.get_type().const_int(1, false),
            "slice_dest_step_eq_one",
        )
        .unwrap();
    let cond_1 = ctx.builder.build_and(dest_step_eq_one, src_slt_dest, "slice_cond_1").unwrap();
    let cond = ctx.builder.build_or(src_eq_dest, cond_1, "slice_cond").unwrap();
    ctx.make_assert(
        generator,
        cond,
        "0:ValueError",
        "attempt to assign sequence of size {0} to slice of size {1} with step size {2}",
        [Some(src_slice_len), Some(dest_slice_len), Some(dest_idx.2)],
        ctx.current_loc,
    );
    let new_len = {
        let args = vec![
            dest_idx.0.into(),   // dest start idx
            dest_idx.1.into(),   // dest end idx
            dest_idx.2.into(),   // dest step
            dest_arr_ptr.into(), // dest arr ptr
            dest_len.into(),     // dest arr len
            src_idx.0.into(),    // src start idx
            src_idx.1.into(),    // src end idx
            src_idx.2.into(),    // src step
            src_arr_ptr.into(),  // src arr ptr
            src_len.into(),      // src arr len
            {
                let s = match ty {
                    BasicTypeEnum::FloatType(t) => t.size_of(),
                    BasicTypeEnum::IntType(t) => t.size_of(),
                    BasicTypeEnum::PointerType(t) => t.size_of(),
                    BasicTypeEnum::StructType(t) => t.size_of().unwrap(),
                    _ => codegen_unreachable!(ctx),
                };
                ctx.builder.build_int_truncate_or_bit_cast(s, int32, "size").unwrap()
            }
            .into(),
        ];
        ctx.builder
            .build_call(slice_assign_fun, args.as_slice(), "slice_assign")
            .map(CallSiteValue::try_as_basic_value)
            .map(|v| v.map_left(BasicValueEnum::into_int_value))
            .map(Either::unwrap_left)
            .unwrap()
    };
    // update length
    let need_update =
        ctx.builder.build_int_compare(IntPredicate::NE, new_len, dest_len, "need_update").unwrap();
    let current = ctx.builder.get_insert_block().unwrap().get_parent().unwrap();
    let update_bb = ctx.ctx.append_basic_block(current, "update");
    let cont_bb = ctx.ctx.append_basic_block(current, "cont");
    ctx.builder.build_conditional_branch(need_update, update_bb, cont_bb).unwrap();
    ctx.builder.position_at_end(update_bb);
    let new_len = ctx.builder.build_int_z_extend_or_bit_cast(new_len, size_ty, "new_len").unwrap();
    dest_arr.store_size(ctx, generator, new_len);
    ctx.builder.build_unconditional_branch(cont_bb).unwrap();
    ctx.builder.position_at_end(cont_bb);
 }
--- a/nac3core/src/codegen/irrt/math.rs
+++ b/nac3core/src/codegen/irrt/math.rs
@ -1,152 +0,0 @@
 use inkwell::{
    values::{BasicValueEnum, CallSiteValue, FloatValue, IntValue},
    IntPredicate,
 };
 use itertools::Either;
 use crate::codegen::{
    macros::codegen_unreachable,
    {CodeGenContext, CodeGenerator},
 };
 // repeated squaring method adapted from GNU Scientific Library:
 // https://git.savannah.gnu.org/cgit/gsl.git/tree/sys/pow_int.c
 pub fn integer_power<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    base: IntValue<'ctx>,
    exp: IntValue<'ctx>,
    signed: bool,
 ) -> IntValue<'ctx> {
    let symbol = match (base.get_type().get_bit_width(), exp.get_type().get_bit_width(), signed) {
        (32, 32, true) => "__nac3_int_exp_int32_t",
        (64, 64, true) => "__nac3_int_exp_int64_t",
        (32, 32, false) => "__nac3_int_exp_uint32_t",
        (64, 64, false) => "__nac3_int_exp_uint64_t",
        _ => codegen_unreachable!(ctx),
    };
    let base_type = base.get_type();
    let pow_fun = ctx.module.get_function(symbol).unwrap_or_else(|| {
        let fn_type = base_type.fn_type(&[base_type.into(), base_type.into()], false);
        ctx.module.add_function(symbol, fn_type, None)
    });
    // throw exception when exp < 0
    let ge_zero = ctx
        .builder
        .build_int_compare(
            IntPredicate::SGE,
            exp,
            exp.get_type().const_zero(),
            "assert_int_pow_ge_0",
        )
        .unwrap();
    ctx.make_assert(
        generator,
        ge_zero,
        "0:ValueError",
        "integer power must be positive or zero",
        [None, None, None],
        ctx.current_loc,
    );
    ctx.builder
        .build_call(pow_fun, &[base.into(), exp.into()], "call_int_pow")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// Generates a call to `isinf` in IR. Returns an `i1` representing the result.
 pub fn call_isinf<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &CodeGenContext<'ctx, '_>,
    v: FloatValue<'ctx>,
 ) -> IntValue<'ctx> {
    let intrinsic_fn = ctx.module.get_function("__nac3_isinf").unwrap_or_else(|| {
        let fn_type = ctx.ctx.i32_type().fn_type(&[ctx.ctx.f64_type().into()], false);
        ctx.module.add_function("__nac3_isinf", fn_type, None)
    });
    let ret = ctx
        .builder
        .build_call(intrinsic_fn, &[v.into()], "isinf")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap();
    generator.bool_to_i1(ctx, ret)
 }
 /// Generates a call to `isnan` in IR. Returns an `i1` representing the result.
 pub fn call_isnan<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &CodeGenContext<'ctx, '_>,
    v: FloatValue<'ctx>,
 ) -> IntValue<'ctx> {
    let intrinsic_fn = ctx.module.get_function("__nac3_isnan").unwrap_or_else(|| {
        let fn_type = ctx.ctx.i32_type().fn_type(&[ctx.ctx.f64_type().into()], false);
        ctx.module.add_function("__nac3_isnan", fn_type, None)
    });
    let ret = ctx
        .builder
        .build_call(intrinsic_fn, &[v.into()], "isnan")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap();
    generator.bool_to_i1(ctx, ret)
 }
 /// Generates a call to `gamma` in IR. Returns an `f64` representing the result.
 pub fn call_gamma<'ctx>(ctx: &CodeGenContext<'ctx, '_>, v: FloatValue<'ctx>) -> FloatValue<'ctx> {
    let llvm_f64 = ctx.ctx.f64_type();
    let intrinsic_fn = ctx.module.get_function("__nac3_gamma").unwrap_or_else(|| {
        let fn_type = llvm_f64.fn_type(&[llvm_f64.into()], false);
        ctx.module.add_function("__nac3_gamma", fn_type, None)
    });
    ctx.builder
        .build_call(intrinsic_fn, &[v.into()], "gamma")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_float_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// Generates a call to `gammaln` in IR. Returns an `f64` representing the result.
 pub fn call_gammaln<'ctx>(ctx: &CodeGenContext<'ctx, '_>, v: FloatValue<'ctx>) -> FloatValue<'ctx> {
    let llvm_f64 = ctx.ctx.f64_type();
    let intrinsic_fn = ctx.module.get_function("__nac3_gammaln").unwrap_or_else(|| {
        let fn_type = llvm_f64.fn_type(&[llvm_f64.into()], false);
        ctx.module.add_function("__nac3_gammaln", fn_type, None)
    });
    ctx.builder
        .build_call(intrinsic_fn, &[v.into()], "gammaln")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_float_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// Generates a call to `j0` in IR. Returns an `f64` representing the result.
 pub fn call_j0<'ctx>(ctx: &CodeGenContext<'ctx, '_>, v: FloatValue<'ctx>) -> FloatValue<'ctx> {
    let llvm_f64 = ctx.ctx.f64_type();
    let intrinsic_fn = ctx.module.get_function("__nac3_j0").unwrap_or_else(|| {
        let fn_type = llvm_f64.fn_type(&[llvm_f64.into()], false);
        ctx.module.add_function("__nac3_j0", fn_type, None)
    });
    ctx.builder
        .build_call(intrinsic_fn, &[v.into()], "j0")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_float_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
--- a/nac3core/src/codegen/irrt/mod.rs
+++ b/nac3core/src/codegen/irrt/mod.rs
@ -3,23 +3,25 @@ use inkwell::{
    context::Context,
    memory_buffer::MemoryBuffer,
    module::Module,
-    values::{BasicValue, BasicValueEnum, IntValue},
+    types::{BasicTypeEnum, IntType},
-    IntPredicate,
+    values::{BasicValue, BasicValueEnum, CallSiteValue, FloatValue, IntValue},
    AddressSpace, IntPredicate,
 };
 use itertools::Either;
 use nac3parser::ast::Expr;
-use super::{CodeGenContext, CodeGenerator};
+use super::{
    classes::{
        ArrayLikeIndexer, ArrayLikeValue, ArraySliceValue, ListValue, NDArrayValue,
        TypedArrayLikeAccessor, TypedArrayLikeAdapter, UntypedArrayLikeAccessor,
    },
    llvm_intrinsics,
    macros::codegen_unreachable,
    stmt::gen_for_callback_incrementing,
    CodeGenContext, CodeGenerator,
 };
 use crate::{symbol_resolver::SymbolResolver, typecheck::typedef::Type};
 pub use list::*;
 pub use math::*;
 pub use ndarray::*;
 pub use slice::*;
 mod list;
 mod math;
 mod ndarray;
 mod slice;
 #[must_use]
 pub fn load_irrt<'ctx>(ctx: &'ctx Context, symbol_resolver: &dyn SymbolResolver) -> Module<'ctx> {
@ -60,6 +62,88 @@ pub fn load_irrt<'ctx>(ctx: &'ctx Context, symbol_resolver: &dyn SymbolResolver)
    irrt_mod
 }
 // repeated squaring method adapted from GNU Scientific Library:
 // https://git.savannah.gnu.org/cgit/gsl.git/tree/sys/pow_int.c
 pub fn integer_power<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    base: IntValue<'ctx>,
    exp: IntValue<'ctx>,
    signed: bool,
 ) -> IntValue<'ctx> {
    let symbol = match (base.get_type().get_bit_width(), exp.get_type().get_bit_width(), signed) {
        (32, 32, true) => "__nac3_int_exp_int32_t",
        (64, 64, true) => "__nac3_int_exp_int64_t",
        (32, 32, false) => "__nac3_int_exp_uint32_t",
        (64, 64, false) => "__nac3_int_exp_uint64_t",
        _ => codegen_unreachable!(ctx),
    };
    let base_type = base.get_type();
    let pow_fun = ctx.module.get_function(symbol).unwrap_or_else(|| {
        let fn_type = base_type.fn_type(&[base_type.into(), base_type.into()], false);
        ctx.module.add_function(symbol, fn_type, None)
    });
    // throw exception when exp < 0
    let ge_zero = ctx
        .builder
        .build_int_compare(
            IntPredicate::SGE,
            exp,
            exp.get_type().const_zero(),
            "assert_int_pow_ge_0",
        )
        .unwrap();
    ctx.make_assert(
        generator,
        ge_zero,
        "0:ValueError",
        "integer power must be positive or zero",
        [None, None, None],
        ctx.current_loc,
    );
    ctx.builder
        .build_call(pow_fun, &[base.into(), exp.into()], "call_int_pow")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 pub fn calculate_len_for_slice_range<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    start: IntValue<'ctx>,
    end: IntValue<'ctx>,
    step: IntValue<'ctx>,
 ) -> IntValue<'ctx> {
    const SYMBOL: &str = "__nac3_range_slice_len";
    let len_func = ctx.module.get_function(SYMBOL).unwrap_or_else(|| {
        let i32_t = ctx.ctx.i32_type();
        let fn_t = i32_t.fn_type(&[i32_t.into(), i32_t.into(), i32_t.into()], false);
        ctx.module.add_function(SYMBOL, fn_t, None)
    });
    // assert step != 0, throw exception if not
    let not_zero = ctx
        .builder
        .build_int_compare(IntPredicate::NE, step, step.get_type().const_zero(), "range_step_ne")
        .unwrap();
    ctx.make_assert(
        generator,
        not_zero,
        "0:ValueError",
        "step must not be zero",
        [None, None, None],
        ctx.current_loc,
    );
    ctx.builder
        .build_call(len_func, &[start.into(), end.into(), step.into()], "calc_len")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// NOTE: the output value of the end index of this function should be compared ***inclusively***,
 /// because python allows `a[2::-1]`, whose semantic is `[a[2], a[1], a[0]]`, which is equivalent to
 /// NO numeric slice in python.
@ -225,3 +309,644 @@ pub fn handle_slice_indices<'ctx, G: CodeGenerator>(
        }
    }))
 }
 /// this function allows index out of range, since python
 /// allows index out of range in slice (`a = [1,2,3]; a[1:10] == [2,3]`).
 pub fn handle_slice_index_bound<'ctx, G: CodeGenerator>(
    i: &Expr<Option<Type>>,
    ctx: &mut CodeGenContext<'ctx, '_>,
    generator: &mut G,
    length: IntValue<'ctx>,
 ) -> Result<Option<IntValue<'ctx>>, String> {
    const SYMBOL: &str = "__nac3_slice_index_bound";
    let func = ctx.module.get_function(SYMBOL).unwrap_or_else(|| {
        let i32_t = ctx.ctx.i32_type();
        let fn_t = i32_t.fn_type(&[i32_t.into(), i32_t.into()], false);
        ctx.module.add_function(SYMBOL, fn_t, None)
    });
    let i = if let Some(v) = generator.gen_expr(ctx, i)? {
        v.to_basic_value_enum(ctx, generator, i.custom.unwrap())?
    } else {
        return Ok(None);
    };
    Ok(Some(
        ctx.builder
            .build_call(func, &[i.into(), length.into()], "bounded_ind")
            .map(CallSiteValue::try_as_basic_value)
            .map(|v| v.map_left(BasicValueEnum::into_int_value))
            .map(Either::unwrap_left)
            .unwrap(),
    ))
 }
 /// This function handles 'end' **inclusively**.
 /// Order of tuples `assign_idx` and `value_idx` is ('start', 'end', 'step').
 /// Negative index should be handled before entering this function
 pub fn list_slice_assignment<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    ty: BasicTypeEnum<'ctx>,
    dest_arr: ListValue<'ctx>,
    dest_idx: (IntValue<'ctx>, IntValue<'ctx>, IntValue<'ctx>),
    src_arr: ListValue<'ctx>,
    src_idx: (IntValue<'ctx>, IntValue<'ctx>, IntValue<'ctx>),
 ) {
    let size_ty = generator.get_size_type(ctx.ctx);
    let int8_ptr = ctx.ctx.i8_type().ptr_type(AddressSpace::default());
    let int32 = ctx.ctx.i32_type();
    let (fun_symbol, elem_ptr_type) = ("__nac3_list_slice_assign_var_size", int8_ptr);
    let slice_assign_fun = {
        let ty_vec = vec![
            int32.into(),         // dest start idx
            int32.into(),         // dest end idx
            int32.into(),         // dest step
            elem_ptr_type.into(), // dest arr ptr
            int32.into(),         // dest arr len
            int32.into(),         // src start idx
            int32.into(),         // src end idx
            int32.into(),         // src step
            elem_ptr_type.into(), // src arr ptr
            int32.into(),         // src arr len
            int32.into(),         // size
        ];
        ctx.module.get_function(fun_symbol).unwrap_or_else(|| {
            let fn_t = int32.fn_type(ty_vec.as_slice(), false);
            ctx.module.add_function(fun_symbol, fn_t, None)
        })
    };
    let zero = int32.const_zero();
    let one = int32.const_int(1, false);
    let dest_arr_ptr = dest_arr.data().base_ptr(ctx, generator);
    let dest_arr_ptr =
        ctx.builder.build_pointer_cast(dest_arr_ptr, elem_ptr_type, "dest_arr_ptr_cast").unwrap();
    let dest_len = dest_arr.load_size(ctx, Some("dest.len"));
    let dest_len = ctx.builder.build_int_truncate_or_bit_cast(dest_len, int32, "srclen32").unwrap();
    let src_arr_ptr = src_arr.data().base_ptr(ctx, generator);
    let src_arr_ptr =
        ctx.builder.build_pointer_cast(src_arr_ptr, elem_ptr_type, "src_arr_ptr_cast").unwrap();
    let src_len = src_arr.load_size(ctx, Some("src.len"));
    let src_len = ctx.builder.build_int_truncate_or_bit_cast(src_len, int32, "srclen32").unwrap();
    // index in bound and positive should be done
    // assert if dest.step == 1 then len(src) <= len(dest) else len(src) == len(dest), and
    // throw exception if not satisfied
    let src_end = ctx
        .builder
        .build_select(
            ctx.builder.build_int_compare(IntPredicate::SLT, src_idx.2, zero, "is_neg").unwrap(),
            ctx.builder.build_int_sub(src_idx.1, one, "e_min_one").unwrap(),
            ctx.builder.build_int_add(src_idx.1, one, "e_add_one").unwrap(),
            "final_e",
        )
        .map(BasicValueEnum::into_int_value)
        .unwrap();
    let dest_end = ctx
        .builder
        .build_select(
            ctx.builder.build_int_compare(IntPredicate::SLT, dest_idx.2, zero, "is_neg").unwrap(),
            ctx.builder.build_int_sub(dest_idx.1, one, "e_min_one").unwrap(),
            ctx.builder.build_int_add(dest_idx.1, one, "e_add_one").unwrap(),
            "final_e",
        )
        .map(BasicValueEnum::into_int_value)
        .unwrap();
    let src_slice_len =
        calculate_len_for_slice_range(generator, ctx, src_idx.0, src_end, src_idx.2);
    let dest_slice_len =
        calculate_len_for_slice_range(generator, ctx, dest_idx.0, dest_end, dest_idx.2);
    let src_eq_dest = ctx
        .builder
        .build_int_compare(IntPredicate::EQ, src_slice_len, dest_slice_len, "slice_src_eq_dest")
        .unwrap();
    let src_slt_dest = ctx
        .builder
        .build_int_compare(IntPredicate::SLT, src_slice_len, dest_slice_len, "slice_src_slt_dest")
        .unwrap();
    let dest_step_eq_one = ctx
        .builder
        .build_int_compare(
            IntPredicate::EQ,
            dest_idx.2,
            dest_idx.2.get_type().const_int(1, false),
            "slice_dest_step_eq_one",
        )
        .unwrap();
    let cond_1 = ctx.builder.build_and(dest_step_eq_one, src_slt_dest, "slice_cond_1").unwrap();
    let cond = ctx.builder.build_or(src_eq_dest, cond_1, "slice_cond").unwrap();
    ctx.make_assert(
        generator,
        cond,
        "0:ValueError",
        "attempt to assign sequence of size {0} to slice of size {1} with step size {2}",
        [Some(src_slice_len), Some(dest_slice_len), Some(dest_idx.2)],
        ctx.current_loc,
    );
    let new_len = {
        let args = vec![
            dest_idx.0.into(),   // dest start idx
            dest_idx.1.into(),   // dest end idx
            dest_idx.2.into(),   // dest step
            dest_arr_ptr.into(), // dest arr ptr
            dest_len.into(),     // dest arr len
            src_idx.0.into(),    // src start idx
            src_idx.1.into(),    // src end idx
            src_idx.2.into(),    // src step
            src_arr_ptr.into(),  // src arr ptr
            src_len.into(),      // src arr len
            {
                let s = match ty {
                    BasicTypeEnum::FloatType(t) => t.size_of(),
                    BasicTypeEnum::IntType(t) => t.size_of(),
                    BasicTypeEnum::PointerType(t) => t.size_of(),
                    BasicTypeEnum::StructType(t) => t.size_of().unwrap(),
                    _ => codegen_unreachable!(ctx),
                };
                ctx.builder.build_int_truncate_or_bit_cast(s, int32, "size").unwrap()
            }
            .into(),
        ];
        ctx.builder
            .build_call(slice_assign_fun, args.as_slice(), "slice_assign")
            .map(CallSiteValue::try_as_basic_value)
            .map(|v| v.map_left(BasicValueEnum::into_int_value))
            .map(Either::unwrap_left)
            .unwrap()
    };
    // update length
    let need_update =
        ctx.builder.build_int_compare(IntPredicate::NE, new_len, dest_len, "need_update").unwrap();
    let current = ctx.builder.get_insert_block().unwrap().get_parent().unwrap();
    let update_bb = ctx.ctx.append_basic_block(current, "update");
    let cont_bb = ctx.ctx.append_basic_block(current, "cont");
    ctx.builder.build_conditional_branch(need_update, update_bb, cont_bb).unwrap();
    ctx.builder.position_at_end(update_bb);
    let new_len = ctx.builder.build_int_z_extend_or_bit_cast(new_len, size_ty, "new_len").unwrap();
    dest_arr.store_size(ctx, generator, new_len);
    ctx.builder.build_unconditional_branch(cont_bb).unwrap();
    ctx.builder.position_at_end(cont_bb);
 }
 /// Generates a call to `isinf` in IR. Returns an `i1` representing the result.
 pub fn call_isinf<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &CodeGenContext<'ctx, '_>,
    v: FloatValue<'ctx>,
 ) -> IntValue<'ctx> {
    let intrinsic_fn = ctx.module.get_function("__nac3_isinf").unwrap_or_else(|| {
        let fn_type = ctx.ctx.i32_type().fn_type(&[ctx.ctx.f64_type().into()], false);
        ctx.module.add_function("__nac3_isinf", fn_type, None)
    });
    let ret = ctx
        .builder
        .build_call(intrinsic_fn, &[v.into()], "isinf")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap();
    generator.bool_to_i1(ctx, ret)
 }
 /// Generates a call to `isnan` in IR. Returns an `i1` representing the result.
 pub fn call_isnan<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &CodeGenContext<'ctx, '_>,
    v: FloatValue<'ctx>,
 ) -> IntValue<'ctx> {
    let intrinsic_fn = ctx.module.get_function("__nac3_isnan").unwrap_or_else(|| {
        let fn_type = ctx.ctx.i32_type().fn_type(&[ctx.ctx.f64_type().into()], false);
        ctx.module.add_function("__nac3_isnan", fn_type, None)
    });
    let ret = ctx
        .builder
        .build_call(intrinsic_fn, &[v.into()], "isnan")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap();
    generator.bool_to_i1(ctx, ret)
 }
 /// Generates a call to `gamma` in IR. Returns an `f64` representing the result.
 pub fn call_gamma<'ctx>(ctx: &CodeGenContext<'ctx, '_>, v: FloatValue<'ctx>) -> FloatValue<'ctx> {
    let llvm_f64 = ctx.ctx.f64_type();
    let intrinsic_fn = ctx.module.get_function("__nac3_gamma").unwrap_or_else(|| {
        let fn_type = llvm_f64.fn_type(&[llvm_f64.into()], false);
        ctx.module.add_function("__nac3_gamma", fn_type, None)
    });
    ctx.builder
        .build_call(intrinsic_fn, &[v.into()], "gamma")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_float_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// Generates a call to `gammaln` in IR. Returns an `f64` representing the result.
 pub fn call_gammaln<'ctx>(ctx: &CodeGenContext<'ctx, '_>, v: FloatValue<'ctx>) -> FloatValue<'ctx> {
    let llvm_f64 = ctx.ctx.f64_type();
    let intrinsic_fn = ctx.module.get_function("__nac3_gammaln").unwrap_or_else(|| {
        let fn_type = llvm_f64.fn_type(&[llvm_f64.into()], false);
        ctx.module.add_function("__nac3_gammaln", fn_type, None)
    });
    ctx.builder
        .build_call(intrinsic_fn, &[v.into()], "gammaln")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_float_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// Generates a call to `j0` in IR. Returns an `f64` representing the result.
 pub fn call_j0<'ctx>(ctx: &CodeGenContext<'ctx, '_>, v: FloatValue<'ctx>) -> FloatValue<'ctx> {
    let llvm_f64 = ctx.ctx.f64_type();
    let intrinsic_fn = ctx.module.get_function("__nac3_j0").unwrap_or_else(|| {
        let fn_type = llvm_f64.fn_type(&[llvm_f64.into()], false);
        ctx.module.add_function("__nac3_j0", fn_type, None)
    });
    ctx.builder
        .build_call(intrinsic_fn, &[v.into()], "j0")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_float_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// Generates a call to `__nac3_ndarray_calc_size`. Returns an [`IntValue`] representing the
 /// calculated total size.
 ///
 /// * `dims` - An [`ArrayLikeIndexer`] containing the size of each dimension.
 /// * `range` - The dimension index to begin and end (exclusively) calculating the dimensions for,
 ///   or [`None`] if starting from the first dimension and ending at the last dimension
 ///   respectively.
 pub fn call_ndarray_calc_size<'ctx, G, Dims>(
    generator: &G,
    ctx: &CodeGenContext<'ctx, '_>,
    dims: &Dims,
    (begin, end): (Option<IntValue<'ctx>>, Option<IntValue<'ctx>>),
 ) -> IntValue<'ctx>
 where
    G: CodeGenerator + ?Sized,
    Dims: ArrayLikeIndexer<'ctx>,
 {
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    let ndarray_calc_size_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_calc_size",
        64 => "__nac3_ndarray_calc_size64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_calc_size_fn_t = llvm_usize.fn_type(
        &[llvm_pusize.into(), llvm_usize.into(), llvm_usize.into(), llvm_usize.into()],
        false,
    );
    let ndarray_calc_size_fn =
        ctx.module.get_function(ndarray_calc_size_fn_name).unwrap_or_else(|| {
            ctx.module.add_function(ndarray_calc_size_fn_name, ndarray_calc_size_fn_t, None)
        });
    let begin = begin.unwrap_or_else(|| llvm_usize.const_zero());
    let end = end.unwrap_or_else(|| dims.size(ctx, generator));
    ctx.builder
        .build_call(
            ndarray_calc_size_fn,
            &[
                dims.base_ptr(ctx, generator).into(),
                dims.size(ctx, generator).into(),
                begin.into(),
                end.into(),
            ],
            "",
        )
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// Generates a call to `__nac3_ndarray_calc_nd_indices`. Returns a [`TypeArrayLikeAdpater`]
 /// containing `i32` indices of the flattened index.
 ///
 /// * `index` - The index to compute the multidimensional index for.
 /// * `ndarray` - LLVM pointer to the `NDArray`. This value must be the LLVM representation of an
 ///   `NDArray`.
 pub fn call_ndarray_calc_nd_indices<'ctx, G: CodeGenerator + ?Sized>(
    generator: &G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    index: IntValue<'ctx>,
    ndarray: NDArrayValue<'ctx>,
 ) -> TypedArrayLikeAdapter<'ctx, IntValue<'ctx>> {
    let llvm_void = ctx.ctx.void_type();
    let llvm_i32 = ctx.ctx.i32_type();
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pi32 = llvm_i32.ptr_type(AddressSpace::default());
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    let ndarray_calc_nd_indices_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_calc_nd_indices",
        64 => "__nac3_ndarray_calc_nd_indices64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_calc_nd_indices_fn =
        ctx.module.get_function(ndarray_calc_nd_indices_fn_name).unwrap_or_else(|| {
            let fn_type = llvm_void.fn_type(
                &[llvm_usize.into(), llvm_pusize.into(), llvm_usize.into(), llvm_pi32.into()],
                false,
            );
            ctx.module.add_function(ndarray_calc_nd_indices_fn_name, fn_type, None)
        });
    let ndarray_num_dims = ndarray.load_ndims(ctx);
    let ndarray_dims = ndarray.dim_sizes();
    let indices = ctx.builder.build_array_alloca(llvm_i32, ndarray_num_dims, "").unwrap();
    ctx.builder
        .build_call(
            ndarray_calc_nd_indices_fn,
            &[
                index.into(),
                ndarray_dims.base_ptr(ctx, generator).into(),
                ndarray_num_dims.into(),
                indices.into(),
            ],
            "",
        )
        .unwrap();
    TypedArrayLikeAdapter::from(
        ArraySliceValue::from_ptr_val(indices, ndarray_num_dims, None),
        Box::new(|_, v| v.into_int_value()),
        Box::new(|_, v| v.into()),
    )
 }
 fn call_ndarray_flatten_index_impl<'ctx, G, Indices>(
    generator: &G,
    ctx: &CodeGenContext<'ctx, '_>,
    ndarray: NDArrayValue<'ctx>,
    indices: &Indices,
 ) -> IntValue<'ctx>
 where
    G: CodeGenerator + ?Sized,
    Indices: ArrayLikeIndexer<'ctx>,
 {
    let llvm_i32 = ctx.ctx.i32_type();
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pi32 = llvm_i32.ptr_type(AddressSpace::default());
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    debug_assert_eq!(
        IntType::try_from(indices.element_type(ctx, generator))
            .map(IntType::get_bit_width)
            .unwrap_or_default(),
        llvm_i32.get_bit_width(),
        "Expected i32 value for argument `indices` to `call_ndarray_flatten_index_impl`"
    );
    debug_assert_eq!(
        indices.size(ctx, generator).get_type().get_bit_width(),
        llvm_usize.get_bit_width(),
        "Expected usize integer value for argument `indices_size` to `call_ndarray_flatten_index_impl`"
    );
    let ndarray_flatten_index_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_flatten_index",
        64 => "__nac3_ndarray_flatten_index64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_flatten_index_fn =
        ctx.module.get_function(ndarray_flatten_index_fn_name).unwrap_or_else(|| {
            let fn_type = llvm_usize.fn_type(
                &[llvm_pusize.into(), llvm_usize.into(), llvm_pi32.into(), llvm_usize.into()],
                false,
            );
            ctx.module.add_function(ndarray_flatten_index_fn_name, fn_type, None)
        });
    let ndarray_num_dims = ndarray.load_ndims(ctx);
    let ndarray_dims = ndarray.dim_sizes();
    let index = ctx
        .builder
        .build_call(
            ndarray_flatten_index_fn,
            &[
                ndarray_dims.base_ptr(ctx, generator).into(),
                ndarray_num_dims.into(),
                indices.base_ptr(ctx, generator).into(),
                indices.size(ctx, generator).into(),
            ],
            "",
        )
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap();
    index
 }
 /// Generates a call to `__nac3_ndarray_flatten_index`. Returns the flattened index for the
 /// multidimensional index.
 ///
 /// * `ndarray` - LLVM pointer to the `NDArray`. This value must be the LLVM representation of an
 ///   `NDArray`.
 /// * `indices` - The multidimensional index to compute the flattened index for.
 pub fn call_ndarray_flatten_index<'ctx, G, Index>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    ndarray: NDArrayValue<'ctx>,
    indices: &Index,
 ) -> IntValue<'ctx>
 where
    G: CodeGenerator + ?Sized,
    Index: ArrayLikeIndexer<'ctx>,
 {
    call_ndarray_flatten_index_impl(generator, ctx, ndarray, indices)
 }
 /// Generates a call to `__nac3_ndarray_calc_broadcast`. Returns a tuple containing the number of
 /// dimension and size of each dimension of the resultant `ndarray`.
 pub fn call_ndarray_calc_broadcast<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    lhs: NDArrayValue<'ctx>,
    rhs: NDArrayValue<'ctx>,
 ) -> TypedArrayLikeAdapter<'ctx, IntValue<'ctx>> {
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    let ndarray_calc_broadcast_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_calc_broadcast",
        64 => "__nac3_ndarray_calc_broadcast64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_calc_broadcast_fn =
        ctx.module.get_function(ndarray_calc_broadcast_fn_name).unwrap_or_else(|| {
            let fn_type = llvm_usize.fn_type(
                &[
                    llvm_pusize.into(),
                    llvm_usize.into(),
                    llvm_pusize.into(),
                    llvm_usize.into(),
                    llvm_pusize.into(),
                ],
                false,
            );
            ctx.module.add_function(ndarray_calc_broadcast_fn_name, fn_type, None)
        });
    let lhs_ndims = lhs.load_ndims(ctx);
    let rhs_ndims = rhs.load_ndims(ctx);
    let min_ndims = llvm_intrinsics::call_int_umin(ctx, lhs_ndims, rhs_ndims, None);
    gen_for_callback_incrementing(
        generator,
        ctx,
        None,
        llvm_usize.const_zero(),
        (min_ndims, false),
        |generator, ctx, _, idx| {
            let idx = ctx.builder.build_int_sub(min_ndims, idx, "").unwrap();
            let (lhs_dim_sz, rhs_dim_sz) = unsafe {
                (
                    lhs.dim_sizes().get_typed_unchecked(ctx, generator, &idx, None),
                    rhs.dim_sizes().get_typed_unchecked(ctx, generator, &idx, None),
                )
            };
            let llvm_usize_const_one = llvm_usize.const_int(1, false);
            let lhs_eqz = ctx
                .builder
                .build_int_compare(IntPredicate::EQ, lhs_dim_sz, llvm_usize_const_one, "")
                .unwrap();
            let rhs_eqz = ctx
                .builder
                .build_int_compare(IntPredicate::EQ, rhs_dim_sz, llvm_usize_const_one, "")
                .unwrap();
            let lhs_or_rhs_eqz = ctx.builder.build_or(lhs_eqz, rhs_eqz, "").unwrap();
            let lhs_eq_rhs = ctx
                .builder
                .build_int_compare(IntPredicate::EQ, lhs_dim_sz, rhs_dim_sz, "")
                .unwrap();
            let is_compatible = ctx.builder.build_or(lhs_or_rhs_eqz, lhs_eq_rhs, "").unwrap();
            ctx.make_assert(
                generator,
                is_compatible,
                "0:ValueError",
                "operands could not be broadcast together",
                [None, None, None],
                ctx.current_loc,
            );
            Ok(())
        },
        llvm_usize.const_int(1, false),
    )
    .unwrap();
    let max_ndims = llvm_intrinsics::call_int_umax(ctx, lhs_ndims, rhs_ndims, None);
    let lhs_dims = lhs.dim_sizes().base_ptr(ctx, generator);
    let lhs_ndims = lhs.load_ndims(ctx);
    let rhs_dims = rhs.dim_sizes().base_ptr(ctx, generator);
    let rhs_ndims = rhs.load_ndims(ctx);
    let out_dims = ctx.builder.build_array_alloca(llvm_usize, max_ndims, "").unwrap();
    let out_dims = ArraySliceValue::from_ptr_val(out_dims, max_ndims, None);
    ctx.builder
        .build_call(
            ndarray_calc_broadcast_fn,
            &[
                lhs_dims.into(),
                lhs_ndims.into(),
                rhs_dims.into(),
                rhs_ndims.into(),
                out_dims.base_ptr(ctx, generator).into(),
            ],
            "",
        )
        .unwrap();
    TypedArrayLikeAdapter::from(
        out_dims,
        Box::new(|_, v| v.into_int_value()),
        Box::new(|_, v| v.into()),
    )
 }
 /// Generates a call to `__nac3_ndarray_calc_broadcast_idx`. Returns an [`ArrayAllocaValue`]
 /// containing the indices used for accessing `array` corresponding to the index of the broadcasted
 /// array `broadcast_idx`.
 pub fn call_ndarray_calc_broadcast_index<
    'ctx,
    G: CodeGenerator + ?Sized,
    BroadcastIdx: UntypedArrayLikeAccessor<'ctx>,
 >(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    array: NDArrayValue<'ctx>,
    broadcast_idx: &BroadcastIdx,
 ) -> TypedArrayLikeAdapter<'ctx, IntValue<'ctx>> {
    let llvm_i32 = ctx.ctx.i32_type();
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pi32 = llvm_i32.ptr_type(AddressSpace::default());
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    let ndarray_calc_broadcast_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_calc_broadcast_idx",
        64 => "__nac3_ndarray_calc_broadcast_idx64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_calc_broadcast_fn =
        ctx.module.get_function(ndarray_calc_broadcast_fn_name).unwrap_or_else(|| {
            let fn_type = llvm_usize.fn_type(
                &[llvm_pusize.into(), llvm_usize.into(), llvm_pi32.into(), llvm_pi32.into()],
                false,
            );
            ctx.module.add_function(ndarray_calc_broadcast_fn_name, fn_type, None)
        });
    let broadcast_size = broadcast_idx.size(ctx, generator);
    let out_idx = ctx.builder.build_array_alloca(llvm_i32, broadcast_size, "").unwrap();
    let array_dims = array.dim_sizes().base_ptr(ctx, generator);
    let array_ndims = array.load_ndims(ctx);
    let broadcast_idx_ptr = unsafe {
        broadcast_idx.ptr_offset_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
    };
    ctx.builder
        .build_call(
            ndarray_calc_broadcast_fn,
            &[array_dims.into(), array_ndims.into(), broadcast_idx_ptr.into(), out_idx.into()],
            "",
        )
        .unwrap();
    TypedArrayLikeAdapter::from(
        ArraySliceValue::from_ptr_val(out_idx, broadcast_size, None),
        Box::new(|_, v| v.into_int_value()),
        Box::new(|_, v| v.into()),
    )
 }
--- a/nac3core/src/codegen/irrt/ndarray.rs
+++ b/nac3core/src/codegen/irrt/ndarray.rs
@ -1,384 +0,0 @@
 use inkwell::{
    types::IntType,
    values::{BasicValueEnum, CallSiteValue, IntValue},
    AddressSpace, IntPredicate,
 };
 use itertools::Either;
 use crate::codegen::{
    llvm_intrinsics,
    macros::codegen_unreachable,
    stmt::gen_for_callback_incrementing,
    values::{
        ArrayLikeIndexer, ArrayLikeValue, ArraySliceValue, NDArrayValue, TypedArrayLikeAccessor,
        TypedArrayLikeAdapter, UntypedArrayLikeAccessor,
    },
    CodeGenContext, CodeGenerator,
 };
 /// Generates a call to `__nac3_ndarray_calc_size`. Returns an [`IntValue`] representing the
 /// calculated total size.
 ///
 /// * `dims` - An [`ArrayLikeIndexer`] containing the size of each dimension.
 /// * `range` - The dimension index to begin and end (exclusively) calculating the dimensions for,
 ///   or [`None`] if starting from the first dimension and ending at the last dimension
 ///   respectively.
 pub fn call_ndarray_calc_size<'ctx, G, Dims>(
    generator: &G,
    ctx: &CodeGenContext<'ctx, '_>,
    dims: &Dims,
    (begin, end): (Option<IntValue<'ctx>>, Option<IntValue<'ctx>>),
 ) -> IntValue<'ctx>
 where
    G: CodeGenerator + ?Sized,
    Dims: ArrayLikeIndexer<'ctx>,
 {
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    let ndarray_calc_size_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_calc_size",
        64 => "__nac3_ndarray_calc_size64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_calc_size_fn_t = llvm_usize.fn_type(
        &[llvm_pusize.into(), llvm_usize.into(), llvm_usize.into(), llvm_usize.into()],
        false,
    );
    let ndarray_calc_size_fn =
        ctx.module.get_function(ndarray_calc_size_fn_name).unwrap_or_else(|| {
            ctx.module.add_function(ndarray_calc_size_fn_name, ndarray_calc_size_fn_t, None)
        });
    let begin = begin.unwrap_or_else(|| llvm_usize.const_zero());
    let end = end.unwrap_or_else(|| dims.size(ctx, generator));
    ctx.builder
        .build_call(
            ndarray_calc_size_fn,
            &[
                dims.base_ptr(ctx, generator).into(),
                dims.size(ctx, generator).into(),
                begin.into(),
                end.into(),
            ],
            "",
        )
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
 /// Generates a call to `__nac3_ndarray_calc_nd_indices`. Returns a [`TypeArrayLikeAdpater`]
 /// containing `i32` indices of the flattened index.
 ///
 /// * `index` - The index to compute the multidimensional index for.
 /// * `ndarray` - LLVM pointer to the `NDArray`. This value must be the LLVM representation of an
 ///   `NDArray`.
 pub fn call_ndarray_calc_nd_indices<'ctx, G: CodeGenerator + ?Sized>(
    generator: &G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    index: IntValue<'ctx>,
    ndarray: NDArrayValue<'ctx>,
 ) -> TypedArrayLikeAdapter<'ctx, IntValue<'ctx>> {
    let llvm_void = ctx.ctx.void_type();
    let llvm_i32 = ctx.ctx.i32_type();
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pi32 = llvm_i32.ptr_type(AddressSpace::default());
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    let ndarray_calc_nd_indices_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_calc_nd_indices",
        64 => "__nac3_ndarray_calc_nd_indices64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_calc_nd_indices_fn =
        ctx.module.get_function(ndarray_calc_nd_indices_fn_name).unwrap_or_else(|| {
            let fn_type = llvm_void.fn_type(
                &[llvm_usize.into(), llvm_pusize.into(), llvm_usize.into(), llvm_pi32.into()],
                false,
            );
            ctx.module.add_function(ndarray_calc_nd_indices_fn_name, fn_type, None)
        });
    let ndarray_num_dims = ndarray.load_ndims(ctx);
    let ndarray_dims = ndarray.shape();
    let indices = ctx.builder.build_array_alloca(llvm_i32, ndarray_num_dims, "").unwrap();
    ctx.builder
        .build_call(
            ndarray_calc_nd_indices_fn,
            &[
                index.into(),
                ndarray_dims.base_ptr(ctx, generator).into(),
                ndarray_num_dims.into(),
                indices.into(),
            ],
            "",
        )
        .unwrap();
    TypedArrayLikeAdapter::from(
        ArraySliceValue::from_ptr_val(indices, ndarray_num_dims, None),
        Box::new(|_, v| v.into_int_value()),
        Box::new(|_, v| v.into()),
    )
 }
 fn call_ndarray_flatten_index_impl<'ctx, G, Indices>(
    generator: &G,
    ctx: &CodeGenContext<'ctx, '_>,
    ndarray: NDArrayValue<'ctx>,
    indices: &Indices,
 ) -> IntValue<'ctx>
 where
    G: CodeGenerator + ?Sized,
    Indices: ArrayLikeIndexer<'ctx>,
 {
    let llvm_i32 = ctx.ctx.i32_type();
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pi32 = llvm_i32.ptr_type(AddressSpace::default());
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    debug_assert_eq!(
        IntType::try_from(indices.element_type(ctx, generator))
            .map(IntType::get_bit_width)
            .unwrap_or_default(),
        llvm_i32.get_bit_width(),
        "Expected i32 value for argument `indices` to `call_ndarray_flatten_index_impl`"
    );
    debug_assert_eq!(
        indices.size(ctx, generator).get_type().get_bit_width(),
        llvm_usize.get_bit_width(),
        "Expected usize integer value for argument `indices_size` to `call_ndarray_flatten_index_impl`"
    );
    let ndarray_flatten_index_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_flatten_index",
        64 => "__nac3_ndarray_flatten_index64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_flatten_index_fn =
        ctx.module.get_function(ndarray_flatten_index_fn_name).unwrap_or_else(|| {
            let fn_type = llvm_usize.fn_type(
                &[llvm_pusize.into(), llvm_usize.into(), llvm_pi32.into(), llvm_usize.into()],
                false,
            );
            ctx.module.add_function(ndarray_flatten_index_fn_name, fn_type, None)
        });
    let ndarray_num_dims = ndarray.load_ndims(ctx);
    let ndarray_dims = ndarray.shape();
    let index = ctx
        .builder
        .build_call(
            ndarray_flatten_index_fn,
            &[
                ndarray_dims.base_ptr(ctx, generator).into(),
                ndarray_num_dims.into(),
                indices.base_ptr(ctx, generator).into(),
                indices.size(ctx, generator).into(),
            ],
            "",
        )
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap();
    index
 }
 /// Generates a call to `__nac3_ndarray_flatten_index`. Returns the flattened index for the
 /// multidimensional index.
 ///
 /// * `ndarray` - LLVM pointer to the `NDArray`. This value must be the LLVM representation of an
 ///   `NDArray`.
 /// * `indices` - The multidimensional index to compute the flattened index for.
 pub fn call_ndarray_flatten_index<'ctx, G, Index>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    ndarray: NDArrayValue<'ctx>,
    indices: &Index,
 ) -> IntValue<'ctx>
 where
    G: CodeGenerator + ?Sized,
    Index: ArrayLikeIndexer<'ctx>,
 {
    call_ndarray_flatten_index_impl(generator, ctx, ndarray, indices)
 }
 /// Generates a call to `__nac3_ndarray_calc_broadcast`. Returns a tuple containing the number of
 /// dimension and size of each dimension of the resultant `ndarray`.
 pub fn call_ndarray_calc_broadcast<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    lhs: NDArrayValue<'ctx>,
    rhs: NDArrayValue<'ctx>,
 ) -> TypedArrayLikeAdapter<'ctx, IntValue<'ctx>> {
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    let ndarray_calc_broadcast_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_calc_broadcast",
        64 => "__nac3_ndarray_calc_broadcast64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_calc_broadcast_fn =
        ctx.module.get_function(ndarray_calc_broadcast_fn_name).unwrap_or_else(|| {
            let fn_type = llvm_usize.fn_type(
                &[
                    llvm_pusize.into(),
                    llvm_usize.into(),
                    llvm_pusize.into(),
                    llvm_usize.into(),
                    llvm_pusize.into(),
                ],
                false,
            );
            ctx.module.add_function(ndarray_calc_broadcast_fn_name, fn_type, None)
        });
    let lhs_ndims = lhs.load_ndims(ctx);
    let rhs_ndims = rhs.load_ndims(ctx);
    let min_ndims = llvm_intrinsics::call_int_umin(ctx, lhs_ndims, rhs_ndims, None);
    gen_for_callback_incrementing(
        generator,
        ctx,
        None,
        llvm_usize.const_zero(),
        (min_ndims, false),
        |generator, ctx, _, idx| {
            let idx = ctx.builder.build_int_sub(min_ndims, idx, "").unwrap();
            let (lhs_dim_sz, rhs_dim_sz) = unsafe {
                (
                    lhs.shape().get_typed_unchecked(ctx, generator, &idx, None),
                    rhs.shape().get_typed_unchecked(ctx, generator, &idx, None),
                )
            };
            let llvm_usize_const_one = llvm_usize.const_int(1, false);
            let lhs_eqz = ctx
                .builder
                .build_int_compare(IntPredicate::EQ, lhs_dim_sz, llvm_usize_const_one, "")
                .unwrap();
            let rhs_eqz = ctx
                .builder
                .build_int_compare(IntPredicate::EQ, rhs_dim_sz, llvm_usize_const_one, "")
                .unwrap();
            let lhs_or_rhs_eqz = ctx.builder.build_or(lhs_eqz, rhs_eqz, "").unwrap();
            let lhs_eq_rhs = ctx
                .builder
                .build_int_compare(IntPredicate::EQ, lhs_dim_sz, rhs_dim_sz, "")
                .unwrap();
            let is_compatible = ctx.builder.build_or(lhs_or_rhs_eqz, lhs_eq_rhs, "").unwrap();
            ctx.make_assert(
                generator,
                is_compatible,
                "0:ValueError",
                "operands could not be broadcast together",
                [None, None, None],
                ctx.current_loc,
            );
            Ok(())
        },
        llvm_usize.const_int(1, false),
    )
    .unwrap();
    let max_ndims = llvm_intrinsics::call_int_umax(ctx, lhs_ndims, rhs_ndims, None);
    let lhs_dims = lhs.shape().base_ptr(ctx, generator);
    let lhs_ndims = lhs.load_ndims(ctx);
    let rhs_dims = rhs.shape().base_ptr(ctx, generator);
    let rhs_ndims = rhs.load_ndims(ctx);
    let out_dims = ctx.builder.build_array_alloca(llvm_usize, max_ndims, "").unwrap();
    let out_dims = ArraySliceValue::from_ptr_val(out_dims, max_ndims, None);
    ctx.builder
        .build_call(
            ndarray_calc_broadcast_fn,
            &[
                lhs_dims.into(),
                lhs_ndims.into(),
                rhs_dims.into(),
                rhs_ndims.into(),
                out_dims.base_ptr(ctx, generator).into(),
            ],
            "",
        )
        .unwrap();
    TypedArrayLikeAdapter::from(
        out_dims,
        Box::new(|_, v| v.into_int_value()),
        Box::new(|_, v| v.into()),
    )
 }
 /// Generates a call to `__nac3_ndarray_calc_broadcast_idx`. Returns an [`ArrayAllocaValue`]
 /// containing the indices used for accessing `array` corresponding to the index of the broadcasted
 /// array `broadcast_idx`.
 pub fn call_ndarray_calc_broadcast_index<
    'ctx,
    G: CodeGenerator + ?Sized,
    BroadcastIdx: UntypedArrayLikeAccessor<'ctx>,
 >(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    array: NDArrayValue<'ctx>,
    broadcast_idx: &BroadcastIdx,
 ) -> TypedArrayLikeAdapter<'ctx, IntValue<'ctx>> {
    let llvm_i32 = ctx.ctx.i32_type();
    let llvm_usize = generator.get_size_type(ctx.ctx);
    let llvm_pi32 = llvm_i32.ptr_type(AddressSpace::default());
    let llvm_pusize = llvm_usize.ptr_type(AddressSpace::default());
    let ndarray_calc_broadcast_fn_name = match llvm_usize.get_bit_width() {
        32 => "__nac3_ndarray_calc_broadcast_idx",
        64 => "__nac3_ndarray_calc_broadcast_idx64",
        bw => codegen_unreachable!(ctx, "Unsupported size type bit width: {}", bw),
    };
    let ndarray_calc_broadcast_fn =
        ctx.module.get_function(ndarray_calc_broadcast_fn_name).unwrap_or_else(|| {
            let fn_type = llvm_usize.fn_type(
                &[llvm_pusize.into(), llvm_usize.into(), llvm_pi32.into(), llvm_pi32.into()],
                false,
            );
            ctx.module.add_function(ndarray_calc_broadcast_fn_name, fn_type, None)
        });
    let broadcast_size = broadcast_idx.size(ctx, generator);
    let out_idx = ctx.builder.build_array_alloca(llvm_i32, broadcast_size, "").unwrap();
    let array_dims = array.shape().base_ptr(ctx, generator);
    let array_ndims = array.load_ndims(ctx);
    let broadcast_idx_ptr = unsafe {
        broadcast_idx.ptr_offset_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
    };
    ctx.builder
        .build_call(
            ndarray_calc_broadcast_fn,
            &[array_dims.into(), array_ndims.into(), broadcast_idx_ptr.into(), out_idx.into()],
            "",
        )
        .unwrap();
    TypedArrayLikeAdapter::from(
        ArraySliceValue::from_ptr_val(out_idx, broadcast_size, None),
        Box::new(|_, v| v.into_int_value()),
        Box::new(|_, v| v.into()),
    )
 }
--- a/nac3core/src/codegen/irrt/slice.rs
+++ b/nac3core/src/codegen/irrt/slice.rs
@ -1,76 +0,0 @@
 use inkwell::{
    values::{BasicValueEnum, CallSiteValue, IntValue},
    IntPredicate,
 };
 use itertools::Either;
 use nac3parser::ast::Expr;
 use crate::{
    codegen::{CodeGenContext, CodeGenerator},
    typecheck::typedef::Type,
 };
 /// this function allows index out of range, since python
 /// allows index out of range in slice (`a = [1,2,3]; a[1:10] == [2,3]`).
 pub fn handle_slice_index_bound<'ctx, G: CodeGenerator>(
    i: &Expr<Option<Type>>,
    ctx: &mut CodeGenContext<'ctx, '_>,
    generator: &mut G,
    length: IntValue<'ctx>,
 ) -> Result<Option<IntValue<'ctx>>, String> {
    const SYMBOL: &str = "__nac3_slice_index_bound";
    let func = ctx.module.get_function(SYMBOL).unwrap_or_else(|| {
        let i32_t = ctx.ctx.i32_type();
        let fn_t = i32_t.fn_type(&[i32_t.into(), i32_t.into()], false);
        ctx.module.add_function(SYMBOL, fn_t, None)
    });
    let i = if let Some(v) = generator.gen_expr(ctx, i)? {
        v.to_basic_value_enum(ctx, generator, i.custom.unwrap())?
    } else {
        return Ok(None);
    };
    Ok(Some(
        ctx.builder
            .build_call(func, &[i.into(), length.into()], "bounded_ind")
            .map(CallSiteValue::try_as_basic_value)
            .map(|v| v.map_left(BasicValueEnum::into_int_value))
            .map(Either::unwrap_left)
            .unwrap(),
    ))
 }
 pub fn calculate_len_for_slice_range<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    start: IntValue<'ctx>,
    end: IntValue<'ctx>,
    step: IntValue<'ctx>,
 ) -> IntValue<'ctx> {
    const SYMBOL: &str = "__nac3_range_slice_len";
    let len_func = ctx.module.get_function(SYMBOL).unwrap_or_else(|| {
        let i32_t = ctx.ctx.i32_type();
        let fn_t = i32_t.fn_type(&[i32_t.into(), i32_t.into(), i32_t.into()], false);
        ctx.module.add_function(SYMBOL, fn_t, None)
    });
    // assert step != 0, throw exception if not
    let not_zero = ctx
        .builder
        .build_int_compare(IntPredicate::NE, step, step.get_type().const_zero(), "range_step_ne")
        .unwrap();
    ctx.make_assert(
        generator,
        not_zero,
        "0:ValueError",
        "step must not be zero",
        [None, None, None],
        ctx.current_loc,
    );
    ctx.builder
        .build_call(len_func, &[start.into(), end.into(), step.into()], "calc_len")
        .map(CallSiteValue::try_as_basic_value)
        .map(|v| v.map_left(BasicValueEnum::into_int_value))
        .map(Either::unwrap_left)
        .unwrap()
 }
--- a/nac3core/src/codegen/llvm_intrinsics.rs
+++ b/nac3core/src/codegen/llvm_intrinsics.rs
@ -7,7 +7,7 @@ use inkwell::{
 };
 use itertools::Either;
-use super::CodeGenContext;
+use crate::codegen::CodeGenContext;
 /// Returns the string representation for the floating-point type `ft` when used in intrinsic
 /// functions.
--- a/nac3core/src/codegen/mod.rs
+++ b/nac3core/src/codegen/mod.rs
@ -29,6 +29,7 @@ use parking_lot::{Condvar, Mutex};
 use nac3parser::ast::{Location, Stmt, StrRef};
 use crate::{
    codegen::classes::{ListType, NDArrayType, ProxyType, RangeType},
    symbol_resolver::{StaticValue, SymbolResolver},
    toplevel::{helper::PrimDef, numpy::unpack_ndarray_var_tys, TopLevelContext, TopLevelDef},
    typecheck::{
@ -36,25 +37,25 @@ use crate::{
        typedef::{CallId, FuncArg, Type, TypeEnum, Unifier},
    },
 };
 use concrete_type::{ConcreteType, ConcreteTypeEnum, ConcreteTypeStore};
 pub use generator::{CodeGenerator, DefaultCodeGenerator};
 use types::{ListType, NDArrayType, ProxyType, RangeType};
 pub mod builtin_fns;
 pub mod classes;
 pub mod concrete_type;
 pub mod expr;
 pub mod extern_fns;
 mod generator;
 pub mod irrt;
 pub mod llvm_intrinsics;
 pub mod model;
 pub mod numpy;
 pub mod stmt;
 pub mod types;
 pub mod values;
 #[cfg(test)]
 mod test;
 use concrete_type::{ConcreteType, ConcreteTypeEnum, ConcreteTypeStore};
 pub use generator::{CodeGenerator, DefaultCodeGenerator};
 mod macros {
    /// Codegen-variant of [`std::unreachable`] which accepts an instance of [`CodeGenContext`] as
    /// its first argument to provide Python source information to indicate the codegen location
--- a/nac3core/src/codegen/model/any.rs
+++ b/nac3core/src/codegen/model/any.rs
@ -0,0 +1,41 @@
 use inkwell::{
    context::Context,
    types::{BasicType, BasicTypeEnum},
    values::BasicValueEnum,
 };
 use super::*;
 use crate::codegen::CodeGenerator;
 /// A [`Model`] of any [`BasicTypeEnum`].
 ///
 /// Use this when it is infeasible to use model abstractions.
 #[derive(Debug, Clone, Copy)]
 pub struct Any<'ctx>(pub BasicTypeEnum<'ctx>);
 impl<'ctx> Model<'ctx> for Any<'ctx> {
    type Value = BasicValueEnum<'ctx>;
    type Type = BasicTypeEnum<'ctx>;
    fn llvm_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        _ctx: &'ctx Context,
    ) -> Self::Type {
        self.0
    }
    fn check_type<T: BasicType<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        _generator: &mut G,
        _ctx: &'ctx Context,
        ty: T,
    ) -> Result<(), ModelError> {
        let ty = ty.as_basic_type_enum();
        if ty == self.0 {
            Ok(())
        } else {
            Err(ModelError(format!("Expecting {}, but got {}", self.0, ty)))
        }
    }
 }
--- a/nac3core/src/codegen/model/array.rs
+++ b/nac3core/src/codegen/model/array.rs
@ -0,0 +1,146 @@
 use std::fmt;
 use inkwell::{
    context::Context,
    types::{ArrayType, BasicType, BasicTypeEnum},
    values::{ArrayValue, IntValue},
 };
 use super::*;
 use crate::codegen::{CodeGenContext, CodeGenerator};
 /// Trait for Rust structs identifying length values for [`Array`].
 pub trait ArrayLen: fmt::Debug + Clone + Copy {
    fn length(&self) -> u32;
 }
 /// A statically known length.
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Len<const N: u32>;
 /// A dynamically known length.
 #[derive(Debug, Clone, Copy)]
 pub struct AnyLen(pub u32);
 impl<const N: u32> ArrayLen for Len<N> {
    fn length(&self) -> u32 {
        N
    }
 }
 impl ArrayLen for AnyLen {
    fn length(&self) -> u32 {
        self.0
    }
 }
 /// A Model for an [`ArrayType`].
 ///
 /// `Len` should be of a [`LenKind`] and `Item` should be a of [`Model`].
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Array<Len, Item> {
    /// Length of this array.
    pub len: Len,
    /// [`Model`] of the array items.
    pub item: Item,
 }
 impl<'ctx, Len: ArrayLen, Item: Model<'ctx>> Model<'ctx> for Array<Len, Item> {
    type Value = ArrayValue<'ctx>;
    type Type = ArrayType<'ctx>;
    fn llvm_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> Self::Type {
        self.item.llvm_type(generator, ctx).array_type(self.len.length())
    }
    fn check_type<T: BasicType<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        ty: T,
    ) -> Result<(), ModelError> {
        let ty = ty.as_basic_type_enum();
        let BasicTypeEnum::ArrayType(ty) = ty else {
            return Err(ModelError(format!("Expecting ArrayType, but got {ty:?}")));
        };
        if ty.len() != self.len.length() {
            return Err(ModelError(format!(
                "Expecting ArrayType with size {}, but got an ArrayType with size {}",
                ty.len(),
                self.len.length()
            )));
        }
        self.item
            .check_type(generator, ctx, ty.get_element_type())
            .map_err(|err| err.under_context("an ArrayType"))?;
        Ok(())
    }
 }
 impl<'ctx, Len: ArrayLen, Item: Model<'ctx>> Instance<'ctx, Ptr<Array<Len, Item>>> {
    /// Get the pointer to the `i`-th (0-based) array element.
    pub fn gep(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        i: IntValue<'ctx>,
    ) -> Instance<'ctx, Ptr<Item>> {
        let zero = ctx.ctx.i32_type().const_zero();
        let ptr = unsafe { ctx.builder.build_in_bounds_gep(self.value, &[zero, i], "").unwrap() };
        unsafe { Ptr(self.model.0.item).believe_value(ptr) }
    }
    /// Like `gep` but `i` is a constant.
    pub fn gep_const(&self, ctx: &CodeGenContext<'ctx, '_>, i: u64) -> Instance<'ctx, Ptr<Item>> {
        assert!(
            i < u64::from(self.model.0.len.length()),
            "Index {i} is out of bounds. Array length = {}",
            self.model.0.len.length()
        );
        let i = ctx.ctx.i32_type().const_int(i, false);
        self.gep(ctx, i)
    }
    /// Convenience function equivalent to `.gep(...).load(...)`.
    pub fn get<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        i: IntValue<'ctx>,
    ) -> Instance<'ctx, Item> {
        self.gep(ctx, i).load(generator, ctx)
    }
    /// Like `get` but `i` is a constant.
    pub fn get_const<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        i: u64,
    ) -> Instance<'ctx, Item> {
        self.gep_const(ctx, i).load(generator, ctx)
    }
    /// Convenience function equivalent to `.gep(...).store(...)`.
    pub fn set(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        i: IntValue<'ctx>,
        value: Instance<'ctx, Item>,
    ) {
        self.gep(ctx, i).store(ctx, value);
    }
    /// Like `set` but `i` is a constant.
    pub fn set_const(&self, ctx: &CodeGenContext<'ctx, '_>, i: u64, value: Instance<'ctx, Item>) {
        self.gep_const(ctx, i).store(ctx, value);
    }
 }
--- a/nac3core/src/codegen/model/core.rs
+++ b/nac3core/src/codegen/model/core.rs
@ -0,0 +1,207 @@
 use std::fmt;
 use inkwell::{context::Context, types::*, values::*};
 use itertools::Itertools;
 use super::*;
 use crate::codegen::{CodeGenContext, CodeGenerator};
 /// A error type for reporting any [`Model`]-related error (e.g., a [`BasicType`] mismatch).
 #[derive(Debug, Clone)]
 pub struct ModelError(pub String);
 impl ModelError {
    /// Append a context message to the error.
    pub(super) fn under_context(mut self, context: &str) -> Self {
        self.0.push_str(" ... in ");
        self.0.push_str(context);
        self
    }
 }
 /// Trait for Rust structs identifying [`BasicType`]s in the context of a known [`CodeGenerator`] and [`CodeGenContext`].
 ///
 /// For instance,
 /// - [`Int<Int32>`] identifies an [`IntType`] with 32-bits.
 /// - [`Int<SizeT>`] identifies an [`IntType`] with bit-width [`CodeGenerator::get_size_type`].
 /// - [`Ptr<Int<SizeT>>`] identifies a [`PointerType`] that points to an [`IntType`] with bit-width [`CodeGenerator::get_size_type`].
 /// - [`Int<AnyInt>`] identifies an [`IntType`] with bit-width of whatever is set in the [`AnyInt`] object.
 /// - [`Any`] identifies a [`BasicType`] set in the [`Any`] object itself.
 ///
 /// You can get the [`BasicType`] out of a model with [`Model::get_type`].
 ///
 /// Furthermore, [`Instance<'ctx, M>`] is a simple structure that carries a [`BasicValue`] with [`BasicType`] identified by model `M`.
 ///
 /// The main purpose of this abstraction is to have a more Rust type-safe way to use Inkwell and give type-hints for programmers.
 ///
 /// ### Notes on `Default` trait
 ///
 /// For some models like [`Int<Int32>`] or [`Int<SizeT>`], they have a [`Default`] trait since just by looking at their types, it is possible
 /// to tell the [`BasicType`]s they are identifying.
 ///
 /// This can be used to create strongly-typed interfaces accepting only values of a specific [`BasicType`] without having to worry about
 /// writing debug assertions to check, for example, if the programmer has passed in an [`IntValue`] with the wrong bit-width.
 /// ```ignore
 /// fn give_me_i32_and_get_a_size_t_back<'ctx>(i32: Instance<'ctx, Int<Int32>>) -> Instance<'ctx, Int<SizeT>> {
 ///     // code...
 /// }
 /// ```
 ///
 /// ### Notes on converting between Inkwell and model/ge.
 ///
 /// Suppose you have an [`IntValue`], and you want to pass it into a function that takes a [`Instance<'ctx, Int<Int32>>`]. You can do use
 /// [`Model::check_value`] or [`Model::believe_value`].
 /// ```ignore
 /// let my_value: IntValue<'ctx>;
 ///
 /// let my_value = Int(Int32).check_value(my_value).unwrap(); // Panics if `my_value` is not 32-bit with a descriptive error message.
 ///
 /// // or, if you are absolutely certain that `my_value` is 32-bit and doing extra checks is a waste of time:
 /// let my_value = Int(Int32).believe_value(my_value);
 /// ```
 pub trait Model<'ctx>: fmt::Debug + Clone + Copy {
    /// The [`BasicType`] *variant* this model is identifying.
    type Type: BasicType<'ctx>;
    /// The [`BasicValue`] type of the [`BasicType`] of this model.
    type Value: BasicValue<'ctx> + TryFrom<BasicValueEnum<'ctx>>;
    /// Return the [`BasicType`] of this model.
    #[must_use]
    fn llvm_type<G: CodeGenerator + ?Sized>(&self, generator: &G, ctx: &'ctx Context)
        -> Self::Type;
    /// Get the number of bytes of the [`BasicType`] of this model.
    fn size_of<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
    ) -> IntValue<'ctx> {
        self.llvm_type(generator, ctx).size_of().unwrap()
    }
    /// Check if a [`BasicType`] matches the [`BasicType`] of this model.
    fn check_type<T: BasicType<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        ty: T,
    ) -> Result<(), ModelError>;
    /// Create an instance from a value.
    ///
    /// # Safety
    ///
    /// Caller must make sure the type of `value` and the type of this `model` are equivalent.
    #[must_use]
    unsafe fn believe_value(&self, value: Self::Value) -> Instance<'ctx, Self> {
        Instance { model: *self, value }
    }
    /// Check if a [`BasicValue`]'s type is equivalent to the type of this model.
    /// Wrap the [`BasicValue`] into an [`Instance`] if it is.
    fn check_value<V: BasicValue<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        value: V,
    ) -> Result<Instance<'ctx, Self>, ModelError> {
        let value = value.as_basic_value_enum();
        self.check_type(generator, ctx, value.get_type())
            .map_err(|err| err.under_context(format!("the value {value:?}").as_str()))?;
        let Ok(value) = Self::Value::try_from(value) else {
            unreachable!("check_type() has bad implementation")
        };
        unsafe { Ok(self.believe_value(value)) }
    }
    // Allocate a value on the stack and return its pointer.
    fn alloca<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
    ) -> Instance<'ctx, Ptr<Self>> {
        let p = ctx.builder.build_alloca(self.llvm_type(generator, ctx.ctx), "").unwrap();
        unsafe { Ptr(*self).believe_value(p) }
    }
    // Allocate an array on the stack and return its pointer.
    fn array_alloca<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        len: IntValue<'ctx>,
    ) -> Instance<'ctx, Ptr<Self>> {
        let p =
            ctx.builder.build_array_alloca(self.llvm_type(generator, ctx.ctx), len, "").unwrap();
        unsafe { Ptr(*self).believe_value(p) }
    }
    fn var_alloca<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        name: Option<&str>,
    ) -> Result<Instance<'ctx, Ptr<Self>>, String> {
        let ty = self.llvm_type(generator, ctx.ctx).as_basic_type_enum();
        let p = generator.gen_var_alloc(ctx, ty, name)?;
        unsafe { Ok(Ptr(*self).believe_value(p)) }
    }
    fn array_var_alloca<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        len: IntValue<'ctx>,
        name: Option<&'ctx str>,
    ) -> Result<Instance<'ctx, Ptr<Self>>, String> {
        // TODO: Remove ArraySliceValue
        let ty = self.llvm_type(generator, ctx.ctx).as_basic_type_enum();
        let p = generator.gen_array_var_alloc(ctx, ty, len, name)?;
        unsafe { Ok(Ptr(*self).believe_value(PointerValue::from(p))) }
    }
    /// Allocate a constant array.
    fn const_array<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        values: &[Instance<'ctx, Self>],
    ) -> Instance<'ctx, Array<AnyLen, Self>> {
        macro_rules! make {
            ($t:expr, $into_value:expr) => {
                $t.const_array(
                    &values
                        .iter()
                        .map(|x| $into_value(x.value.as_basic_value_enum()))
                        .collect_vec(),
                )
            };
        }
        let value = match self.llvm_type(generator, ctx).as_basic_type_enum() {
            BasicTypeEnum::ArrayType(t) => make!(t, BasicValueEnum::into_array_value),
            BasicTypeEnum::IntType(t) => make!(t, BasicValueEnum::into_int_value),
            BasicTypeEnum::FloatType(t) => make!(t, BasicValueEnum::into_float_value),
            BasicTypeEnum::PointerType(t) => make!(t, BasicValueEnum::into_pointer_value),
            BasicTypeEnum::StructType(t) => make!(t, BasicValueEnum::into_struct_value),
            BasicTypeEnum::VectorType(t) => make!(t, BasicValueEnum::into_vector_value),
        };
        Array { len: AnyLen(values.len() as u32), item: *self }
            .check_value(generator, ctx, value)
            .unwrap()
    }
 }
 #[derive(Debug, Clone, Copy)]
 pub struct Instance<'ctx, M: Model<'ctx>> {
    /// The model of this instance.
    pub model: M,
    /// The value of this instance.
    ///
    /// It is guaranteed the [`BasicType`] of `value` is consistent with that of `model`.
    pub value: M::Value,
 }
--- a/nac3core/src/codegen/model/float.rs
+++ b/nac3core/src/codegen/model/float.rs
@ -0,0 +1,93 @@
 use std::fmt;
 use inkwell::{
    context::Context,
    types::{BasicType, FloatType},
    values::FloatValue,
 };
 use super::*;
 use crate::codegen::CodeGenerator;
 pub trait FloatKind<'ctx>: fmt::Debug + Clone + Copy {
    fn get_float_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> FloatType<'ctx>;
 }
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Float32;
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Float64;
 impl<'ctx> FloatKind<'ctx> for Float32 {
    fn get_float_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        ctx: &'ctx Context,
    ) -> FloatType<'ctx> {
        ctx.f32_type()
    }
 }
 impl<'ctx> FloatKind<'ctx> for Float64 {
    fn get_float_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        ctx: &'ctx Context,
    ) -> FloatType<'ctx> {
        ctx.f64_type()
    }
 }
 #[derive(Debug, Clone, Copy)]
 pub struct AnyFloat<'ctx>(FloatType<'ctx>);
 impl<'ctx> FloatKind<'ctx> for AnyFloat<'ctx> {
    fn get_float_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        _ctx: &'ctx Context,
    ) -> FloatType<'ctx> {
        self.0
    }
 }
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Float<N>(pub N);
 impl<'ctx, N: FloatKind<'ctx>> Model<'ctx> for Float<N> {
    type Value = FloatValue<'ctx>;
    type Type = FloatType<'ctx>;
    fn llvm_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> Self::Type {
        self.0.get_float_type(generator, ctx)
    }
    fn check_type<T: BasicType<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        ty: T,
    ) -> Result<(), ModelError> {
        let ty = ty.as_basic_type_enum();
        let Ok(ty) = FloatType::try_from(ty) else {
            return Err(ModelError(format!("Expecting FloatType, but got {ty:?}")));
        };
        let exp_ty = self.0.get_float_type(generator, ctx);
        // TODO: Inkwell does not have get_bit_width for FloatType?
        if ty != exp_ty {
            return Err(ModelError(format!("Expecting {exp_ty:?}, but got {ty:?}")));
        }
        Ok(())
    }
 }
--- a/nac3core/src/codegen/model/function.rs
+++ b/nac3core/src/codegen/model/function.rs
@ -0,0 +1,121 @@
 use inkwell::{
    attributes::{Attribute, AttributeLoc},
    types::{BasicMetadataTypeEnum, BasicType, FunctionType},
    values::{AnyValue, BasicMetadataValueEnum, BasicValue, BasicValueEnum, CallSiteValue},
 };
 use itertools::Itertools;
 use super::*;
 use crate::codegen::{CodeGenContext, CodeGenerator};
 #[derive(Debug, Clone, Copy)]
 struct Arg<'ctx> {
    ty: BasicMetadataTypeEnum<'ctx>,
    val: BasicMetadataValueEnum<'ctx>,
 }
 /// A convenience structure to construct & call an LLVM function.
 ///
 /// ### Usage
 ///
 /// The syntax is like this:
 /// ```ignore
 /// let result = CallFunction::begin("my_function_name")
 ///   .attrs(...)
 ///   .arg(arg1)
 ///   .arg(arg2)
 ///   .arg(arg3)
 ///   .returning("my_function_result", Int32);
 /// ```
 ///
 /// The function `my_function_name` is called when `.returning()` (or its variants) is called, returning
 /// the result as an `Instance<'ctx, Int<Int32>>`.
 ///
 /// If `my_function_name` has not been declared in `ctx.module`, once `.returning()` is called, a function
 /// declaration of `my_function_name` is added to `ctx.module`, where the [`FunctionType`] is deduced from
 /// the argument types and returning type.
 pub struct FnCall<'ctx, 'a, 'b, 'c, 'd, G: CodeGenerator + ?Sized> {
    generator: &'d mut G,
    ctx: &'b CodeGenContext<'ctx, 'a>,
    /// Function name
    name: &'c str,
    /// Call arguments
    args: Vec<Arg<'ctx>>,
    /// LLVM function Attributes
    attrs: Vec<&'static str>,
 }
 impl<'ctx, 'a, 'b, 'c, 'd, G: CodeGenerator + ?Sized> FnCall<'ctx, 'a, 'b, 'c, 'd, G> {
    pub fn builder(generator: &'d mut G, ctx: &'b CodeGenContext<'ctx, 'a>, name: &'c str) -> Self {
        FnCall { generator, ctx, name, args: Vec::new(), attrs: Vec::new() }
    }
    /// Push a list of LLVM function attributes to the function declaration.
    #[must_use]
    pub fn attrs(mut self, attrs: Vec<&'static str>) -> Self {
        self.attrs = attrs;
        self
    }
    /// Push a call argument to the function call.
    #[allow(clippy::needless_pass_by_value)]
    #[must_use]
    pub fn arg<M: Model<'ctx>>(mut self, arg: Instance<'ctx, M>) -> Self {
        let arg = Arg {
            ty: arg.model.llvm_type(self.generator, self.ctx.ctx).as_basic_type_enum().into(),
            val: arg.value.as_basic_value_enum().into(),
        };
        self.args.push(arg);
        self
    }
    /// Call the function and expect the function to return a value of type of `return_model`.
    #[must_use]
    pub fn returning<M: Model<'ctx>>(self, name: &str, return_model: M) -> Instance<'ctx, M> {
        let ret_ty = return_model.llvm_type(self.generator, self.ctx.ctx);
        let ret = self.call(|tys| ret_ty.fn_type(tys, false), name);
        let ret = BasicValueEnum::try_from(ret.as_any_value_enum()).unwrap(); // Must work
        let ret = return_model.check_value(self.generator, self.ctx.ctx, ret).unwrap(); // Must work
        ret
    }
    /// Like [`CallFunction::returning_`] but `return_model` is automatically inferred.
    #[must_use]
    pub fn returning_auto<M: Model<'ctx> + Default>(self, name: &str) -> Instance<'ctx, M> {
        self.returning(name, M::default())
    }
    /// Call the function and expect the function to return a void-type.
    pub fn returning_void(self) {
        let ret_ty = self.ctx.ctx.void_type();
        let _ = self.call(|tys| ret_ty.fn_type(tys, false), "");
    }
    fn call<F>(&self, make_fn_type: F, return_value_name: &str) -> CallSiteValue<'ctx>
    where
        F: FnOnce(&[BasicMetadataTypeEnum<'ctx>]) -> FunctionType<'ctx>,
    {
        // Get the LLVM function.
        let func = self.ctx.module.get_function(self.name).unwrap_or_else(|| {
            // Declare the function if it doesn't exist.
            let tys = self.args.iter().map(|arg| arg.ty).collect_vec();
            let func_type = make_fn_type(&tys);
            let func = self.ctx.module.add_function(self.name, func_type, None);
            for attr in &self.attrs {
                func.add_attribute(
                    AttributeLoc::Function,
                    self.ctx.ctx.create_enum_attribute(Attribute::get_named_enum_kind_id(attr), 0),
                );
            }
            func
        });
        let vals = self.args.iter().map(|arg| arg.val).collect_vec();
        self.ctx.builder.build_call(func, &vals, return_value_name).unwrap()
    }
 }
--- a/nac3core/src/codegen/model/int.rs
+++ b/nac3core/src/codegen/model/int.rs
@ -0,0 +1,421 @@
 use std::{cmp::Ordering, fmt};
 use inkwell::{
    context::Context,
    types::{BasicType, IntType},
    values::IntValue,
    IntPredicate,
 };
 use super::*;
 use crate::codegen::{CodeGenContext, CodeGenerator};
 pub trait IntKind<'ctx>: fmt::Debug + Clone + Copy {
    fn get_int_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> IntType<'ctx>;
 }
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Bool;
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Byte;
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Int32;
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Int64;
 #[derive(Debug, Clone, Copy, Default)]
 pub struct SizeT;
 impl<'ctx> IntKind<'ctx> for Bool {
    fn get_int_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        ctx: &'ctx Context,
    ) -> IntType<'ctx> {
        ctx.bool_type()
    }
 }
 impl<'ctx> IntKind<'ctx> for Byte {
    fn get_int_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        ctx: &'ctx Context,
    ) -> IntType<'ctx> {
        ctx.i8_type()
    }
 }
 impl<'ctx> IntKind<'ctx> for Int32 {
    fn get_int_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        ctx: &'ctx Context,
    ) -> IntType<'ctx> {
        ctx.i32_type()
    }
 }
 impl<'ctx> IntKind<'ctx> for Int64 {
    fn get_int_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        ctx: &'ctx Context,
    ) -> IntType<'ctx> {
        ctx.i64_type()
    }
 }
 impl<'ctx> IntKind<'ctx> for SizeT {
    fn get_int_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> IntType<'ctx> {
        generator.get_size_type(ctx)
    }
 }
 #[derive(Debug, Clone, Copy)]
 pub struct AnyInt<'ctx>(pub IntType<'ctx>);
 impl<'ctx> IntKind<'ctx> for AnyInt<'ctx> {
    fn get_int_type<G: CodeGenerator + ?Sized>(
        &self,
        _generator: &G,
        _ctx: &'ctx Context,
    ) -> IntType<'ctx> {
        self.0
    }
 }
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Int<N>(pub N);
 impl<'ctx, N: IntKind<'ctx>> Model<'ctx> for Int<N> {
    type Value = IntValue<'ctx>;
    type Type = IntType<'ctx>;
    fn llvm_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> Self::Type {
        self.0.get_int_type(generator, ctx)
    }
    fn check_type<T: BasicType<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        ty: T,
    ) -> Result<(), ModelError> {
        let ty = ty.as_basic_type_enum();
        let Ok(ty) = IntType::try_from(ty) else {
            return Err(ModelError(format!("Expecting IntType, but got {ty:?}")));
        };
        let exp_ty = self.0.get_int_type(generator, ctx);
        if ty.get_bit_width() != exp_ty.get_bit_width() {
            return Err(ModelError(format!(
                "Expecting IntType to have {} bit(s), but got {} bit(s)",
                exp_ty.get_bit_width(),
                ty.get_bit_width()
            )));
        }
        Ok(())
    }
 }
 impl<'ctx, N: IntKind<'ctx>> Int<N> {
    pub fn const_int<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        value: u64,
        sign_extend: bool,
    ) -> Instance<'ctx, Self> {
        let value = self.llvm_type(generator, ctx).const_int(value, sign_extend);
        unsafe { self.believe_value(value) }
    }
    pub fn const_0<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
    ) -> Instance<'ctx, Self> {
        let value = self.llvm_type(generator, ctx).const_zero();
        unsafe { self.believe_value(value) }
    }
    pub fn const_1<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
    ) -> Instance<'ctx, Self> {
        self.const_int(generator, ctx, 1, false)
    }
    pub fn const_all_ones<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
    ) -> Instance<'ctx, Self> {
        let value = self.llvm_type(generator, ctx).const_all_ones();
        unsafe { self.believe_value(value) }
    }
    pub fn s_extend_or_bit_cast<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> Instance<'ctx, Self> {
        assert!(
            value.get_type().get_bit_width()
                <= self.0.get_int_type(generator, ctx.ctx).get_bit_width()
        );
        let value = ctx
            .builder
            .build_int_s_extend_or_bit_cast(value, self.llvm_type(generator, ctx.ctx), "")
            .unwrap();
        unsafe { self.believe_value(value) }
    }
    pub fn s_extend<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> Instance<'ctx, Self> {
        assert!(
            value.get_type().get_bit_width()
                < self.0.get_int_type(generator, ctx.ctx).get_bit_width()
        );
        let value =
            ctx.builder.build_int_s_extend(value, self.llvm_type(generator, ctx.ctx), "").unwrap();
        unsafe { self.believe_value(value) }
    }
    pub fn z_extend_or_bit_cast<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> Instance<'ctx, Self> {
        assert!(
            value.get_type().get_bit_width()
                <= self.0.get_int_type(generator, ctx.ctx).get_bit_width()
        );
        let value = ctx
            .builder
            .build_int_z_extend_or_bit_cast(value, self.llvm_type(generator, ctx.ctx), "")
            .unwrap();
        unsafe { self.believe_value(value) }
    }
    pub fn z_extend<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> Instance<'ctx, Self> {
        assert!(
            value.get_type().get_bit_width()
                < self.0.get_int_type(generator, ctx.ctx).get_bit_width()
        );
        let value =
            ctx.builder.build_int_z_extend(value, self.llvm_type(generator, ctx.ctx), "").unwrap();
        unsafe { self.believe_value(value) }
    }
    pub fn truncate_or_bit_cast<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> Instance<'ctx, Self> {
        assert!(
            value.get_type().get_bit_width()
                >= self.0.get_int_type(generator, ctx.ctx).get_bit_width()
        );
        let value = ctx
            .builder
            .build_int_truncate_or_bit_cast(value, self.llvm_type(generator, ctx.ctx), "")
            .unwrap();
        unsafe { self.believe_value(value) }
    }
    pub fn truncate<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> Instance<'ctx, Self> {
        assert!(
            value.get_type().get_bit_width()
                > self.0.get_int_type(generator, ctx.ctx).get_bit_width()
        );
        let value =
            ctx.builder.build_int_truncate(value, self.llvm_type(generator, ctx.ctx), "").unwrap();
        unsafe { self.believe_value(value) }
    }
    /// `sext` or `trunc` an int to this model's int type. Does nothing if equal bit-widths.
    pub fn s_extend_or_truncate<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> Instance<'ctx, Self> {
        let their_width = value.get_type().get_bit_width();
        let our_width = self.0.get_int_type(generator, ctx.ctx).get_bit_width();
        match their_width.cmp(&our_width) {
            Ordering::Less => self.s_extend(generator, ctx, value),
            Ordering::Equal => unsafe { self.believe_value(value) },
            Ordering::Greater => self.truncate(generator, ctx, value),
        }
    }
    /// `zext` or `trunc` an int to this model's int type. Does nothing if equal bit-widths.
    pub fn z_extend_or_truncate<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> Instance<'ctx, Self> {
        let their_width = value.get_type().get_bit_width();
        let our_width = self.0.get_int_type(generator, ctx.ctx).get_bit_width();
        match their_width.cmp(&our_width) {
            Ordering::Less => self.z_extend(generator, ctx, value),
            Ordering::Equal => unsafe { self.believe_value(value) },
            Ordering::Greater => self.truncate(generator, ctx, value),
        }
    }
 }
 impl Int<Bool> {
    #[must_use]
    pub fn const_false<'ctx, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
    ) -> Instance<'ctx, Self> {
        self.const_int(generator, ctx, 0, false)
    }
    #[must_use]
    pub fn const_true<'ctx, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
    ) -> Instance<'ctx, Self> {
        self.const_int(generator, ctx, 1, false)
    }
 }
 impl<'ctx, N: IntKind<'ctx>> Instance<'ctx, Int<N>> {
    pub fn s_extend_or_bit_cast<NewN: IntKind<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        to_int_kind: NewN,
    ) -> Instance<'ctx, Int<NewN>> {
        Int(to_int_kind).s_extend_or_bit_cast(generator, ctx, self.value)
    }
    pub fn s_extend<NewN: IntKind<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        to_int_kind: NewN,
    ) -> Instance<'ctx, Int<NewN>> {
        Int(to_int_kind).s_extend(generator, ctx, self.value)
    }
    pub fn z_extend_or_bit_cast<NewN: IntKind<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        to_int_kind: NewN,
    ) -> Instance<'ctx, Int<NewN>> {
        Int(to_int_kind).z_extend_or_bit_cast(generator, ctx, self.value)
    }
    pub fn z_extend<NewN: IntKind<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        to_int_kind: NewN,
    ) -> Instance<'ctx, Int<NewN>> {
        Int(to_int_kind).z_extend(generator, ctx, self.value)
    }
    pub fn truncate_or_bit_cast<NewN: IntKind<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        to_int_kind: NewN,
    ) -> Instance<'ctx, Int<NewN>> {
        Int(to_int_kind).truncate_or_bit_cast(generator, ctx, self.value)
    }
    pub fn truncate<NewN: IntKind<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        to_int_kind: NewN,
    ) -> Instance<'ctx, Int<NewN>> {
        Int(to_int_kind).truncate(generator, ctx, self.value)
    }
    pub fn s_extend_or_truncate<NewN: IntKind<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        to_int_kind: NewN,
    ) -> Instance<'ctx, Int<NewN>> {
        Int(to_int_kind).s_extend_or_truncate(generator, ctx, self.value)
    }
    pub fn z_extend_or_truncate<NewN: IntKind<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        to_int_kind: NewN,
    ) -> Instance<'ctx, Int<NewN>> {
        Int(to_int_kind).z_extend_or_truncate(generator, ctx, self.value)
    }
    #[must_use]
    pub fn add(&self, ctx: &CodeGenContext<'ctx, '_>, other: Self) -> Self {
        let value = ctx.builder.build_int_add(self.value, other.value, "").unwrap();
        unsafe { self.model.believe_value(value) }
    }
    #[must_use]
    pub fn sub(&self, ctx: &CodeGenContext<'ctx, '_>, other: Self) -> Self {
        let value = ctx.builder.build_int_sub(self.value, other.value, "").unwrap();
        unsafe { self.model.believe_value(value) }
    }
    #[must_use]
    pub fn mul(&self, ctx: &CodeGenContext<'ctx, '_>, other: Self) -> Self {
        let value = ctx.builder.build_int_mul(self.value, other.value, "").unwrap();
        unsafe { self.model.believe_value(value) }
    }
    pub fn compare(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        op: IntPredicate,
        other: Self,
    ) -> Instance<'ctx, Int<Bool>> {
        let value = ctx.builder.build_int_compare(op, self.value, other.value, "").unwrap();
        unsafe { Int(Bool).believe_value(value) }
    }
 }
--- a/nac3core/src/codegen/model/mod.rs
+++ b/nac3core/src/codegen/model/mod.rs
@ -0,0 +1,16 @@
 mod any;
 mod array;
 mod core;
 mod float;
 pub mod function;
 mod int;
 mod ptr;
 mod structure;
 pub use any::*;
 pub use array::*;
 pub use core::*;
 pub use float::*;
 pub use int::*;
 pub use ptr::*;
 pub use structure::*;
--- a/nac3core/src/codegen/model/ptr.rs
+++ b/nac3core/src/codegen/model/ptr.rs
@ -0,0 +1,213 @@
 use inkwell::{
    context::Context,
    types::{BasicType, BasicTypeEnum, PointerType},
    values::{IntValue, PointerValue},
    AddressSpace,
 };
 use super::*;
 use crate::codegen::{llvm_intrinsics::call_memcpy_generic, CodeGenContext, CodeGenerator};
 /// A model for [`PointerType`].
 ///
 /// `Item` is the element type this pointer is pointing to, and should be of a [`Model`].
 ///
 // TODO: LLVM 15: `Item` is a Rust type-hint for the LLVM type of value the `.store()/.load()` family
 // of functions return. If a truly opaque pointer is needed, tell the programmer to use `OpaquePtr`.
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Ptr<Item>(pub Item);
 /// An opaque pointer. Like [`Ptr`] but without any Rust type-hints about its element type.
 ///
 /// `.load()/.store()` is not available for [`Instance`]s of opaque pointers.
 pub type OpaquePtr = Ptr<()>;
 // TODO: LLVM 15: `Item: Model<'ctx>` don't even need to be a model anymore. It will only be
 // a type-hint for the `.load()/.store()` functions for the `pointee_ty`.
 //
 // See https://thedan64.github.io/inkwell/inkwell/builder/struct.Builder.html#method.build_load.
 impl<'ctx, Item: Model<'ctx>> Model<'ctx> for Ptr<Item> {
    type Value = PointerValue<'ctx>;
    type Type = PointerType<'ctx>;
    fn llvm_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> Self::Type {
        // TODO: LLVM 15: ctx.ptr_type(AddressSpace::default())
        self.0.llvm_type(generator, ctx).ptr_type(AddressSpace::default())
    }
    fn check_type<T: BasicType<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        ty: T,
    ) -> Result<(), ModelError> {
        let ty = ty.as_basic_type_enum();
        let Ok(ty) = PointerType::try_from(ty) else {
            return Err(ModelError(format!("Expecting PointerType, but got {ty:?}")));
        };
        let elem_ty = ty.get_element_type();
        let Ok(elem_ty) = BasicTypeEnum::try_from(elem_ty) else {
            return Err(ModelError(format!(
                "Expecting pointer element type to be a BasicTypeEnum, but got {elem_ty:?}"
            )));
        };
        // TODO: inkwell `get_element_type()` will be deprecated.
        // Remove the check for `get_element_type()` when the time comes.
        self.0
            .check_type(generator, ctx, elem_ty)
            .map_err(|err| err.under_context("a PointerType"))?;
        Ok(())
    }
 }
 impl<'ctx, Item: Model<'ctx>> Ptr<Item> {
    /// Return a ***constant*** nullptr.
    pub fn nullptr<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
    ) -> Instance<'ctx, Ptr<Item>> {
        let ptr = self.llvm_type(generator, ctx).const_null();
        unsafe { self.believe_value(ptr) }
    }
    /// Cast a pointer into this model with [`inkwell::builder::Builder::build_pointer_cast`]
    pub fn pointer_cast<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        ptr: PointerValue<'ctx>,
    ) -> Instance<'ctx, Ptr<Item>> {
        // TODO: LLVM 15: Write in an impl where `Item` does not have to be `Model<'ctx>`.
        // TODO: LLVM 15: This function will only have to be:
        // ```
        // return self.believe_value(ptr);
        // ```
        let t = self.llvm_type(generator, ctx.ctx);
        let ptr = ctx.builder.build_pointer_cast(ptr, t, "").unwrap();
        unsafe { self.believe_value(ptr) }
    }
 }
 impl<'ctx, Item: Model<'ctx>> Instance<'ctx, Ptr<Item>> {
    /// Offset the pointer by [`inkwell::builder::Builder::build_in_bounds_gep`].
    #[must_use]
    pub fn offset(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        offset: IntValue<'ctx>,
    ) -> Instance<'ctx, Ptr<Item>> {
        let p = unsafe { ctx.builder.build_in_bounds_gep(self.value, &[offset], "").unwrap() };
        unsafe { self.model.believe_value(p) }
    }
    /// Offset the pointer by [`inkwell::builder::Builder::build_in_bounds_gep`] by a constant offset.
    #[must_use]
    pub fn offset_const(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        offset: i64,
    ) -> Instance<'ctx, Ptr<Item>> {
        let offset = ctx.ctx.i32_type().const_int(offset as u64, true);
        self.offset(ctx, offset)
    }
    pub fn set_index(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        index: IntValue<'ctx>,
        value: Instance<'ctx, Item>,
    ) {
        self.offset(ctx, index).store(ctx, value);
    }
    pub fn set_index_const(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        index: i64,
        value: Instance<'ctx, Item>,
    ) {
        self.offset_const(ctx, index).store(ctx, value);
    }
    pub fn get_index<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        index: IntValue<'ctx>,
    ) -> Instance<'ctx, Item> {
        self.offset(ctx, index).load(generator, ctx)
    }
    pub fn get_index_const<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        index: i64,
    ) -> Instance<'ctx, Item> {
        self.offset_const(ctx, index).load(generator, ctx)
    }
    /// Load the value with [`inkwell::builder::Builder::build_load`].
    pub fn load<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
    ) -> Instance<'ctx, Item> {
        let value = ctx.builder.build_load(self.value, "").unwrap();
        self.model.0.check_value(generator, ctx.ctx, value).unwrap() // If unwrap() panics, there is a logic error.
    }
    /// Store a value with [`inkwell::builder::Builder::build_store`].
    pub fn store(&self, ctx: &CodeGenContext<'ctx, '_>, value: Instance<'ctx, Item>) {
        ctx.builder.build_store(self.value, value.value).unwrap();
    }
    /// Return a casted pointer of element type `NewElement` with [`inkwell::builder::Builder::build_pointer_cast`].
    pub fn pointer_cast<NewItem: Model<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        new_item: NewItem,
    ) -> Instance<'ctx, Ptr<NewItem>> {
        // TODO: LLVM 15: Write in an impl where `Item` does not have to be `Model<'ctx>`.
        Ptr(new_item).pointer_cast(generator, ctx, self.value)
    }
    /// Check if the pointer is null with [`inkwell::builder::Builder::build_is_null`].
    pub fn is_null(&self, ctx: &CodeGenContext<'ctx, '_>) -> Instance<'ctx, Int<Bool>> {
        let value = ctx.builder.build_is_null(self.value, "").unwrap();
        unsafe { Int(Bool).believe_value(value) }
    }
    /// Check if the pointer is not null with [`inkwell::builder::Builder::build_is_not_null`].
    pub fn is_not_null(&self, ctx: &CodeGenContext<'ctx, '_>) -> Instance<'ctx, Int<Bool>> {
        let value = ctx.builder.build_is_not_null(self.value, "").unwrap();
        unsafe { Int(Bool).believe_value(value) }
    }
    /// `memcpy` from another pointer.
    pub fn copy_from<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        source: Self,
        num_items: IntValue<'ctx>,
    ) {
        // Force extend `num_items` and `itemsize` to `i64` so their types would match.
        let itemsize = self.model.size_of(generator, ctx.ctx);
        let itemsize = Int(SizeT).z_extend_or_truncate(generator, ctx, itemsize);
        let num_items = Int(SizeT).z_extend_or_truncate(generator, ctx, num_items);
        let totalsize = itemsize.mul(ctx, num_items);
        let is_volatile = ctx.ctx.bool_type().const_zero(); // is_volatile = false
        call_memcpy_generic(ctx, self.value, source.value, totalsize.value, is_volatile);
    }
 }
--- a/nac3core/src/codegen/model/structure.rs
+++ b/nac3core/src/codegen/model/structure.rs
@ -0,0 +1,363 @@
 use std::fmt;
 use inkwell::{
    context::Context,
    types::{BasicType, BasicTypeEnum, StructType},
    values::{BasicValueEnum, StructValue},
 };
 use super::*;
 use crate::codegen::{CodeGenContext, CodeGenerator};
 /// A traveral that traverses a Rust `struct` that is used to declare an LLVM's struct's field types.
 pub trait FieldTraversal<'ctx> {
    /// Output type of [`FieldTraversal::add`].
    type Output<M>;
    /// Traverse through the type of a declared field and do something with it.
    ///
    /// * `name` - The cosmetic name of the LLVM field. Used for debugging.
    /// * `model` - The [`Model`] representing the LLVM type of this field.
    fn add<M: Model<'ctx>>(&mut self, name: &'static str, model: M) -> Self::Output<M>;
    /// Like [`FieldTraversal::add`] but [`Model`] is automatically inferred from its [`Default`] trait.
    fn add_auto<M: Model<'ctx> + Default>(&mut self, name: &'static str) -> Self::Output<M> {
        self.add(name, M::default())
    }
 }
 /// Descriptor of an LLVM struct field.
 #[derive(Debug, Clone, Copy)]
 pub struct GepField<M> {
    /// The GEP index of this field. This is the index to use with `build_gep`.
    pub gep_index: u32,
    /// The cosmetic name of this field.
    pub name: &'static str,
    /// The [`Model`] of this field's type.
    pub model: M,
 }
 /// A traversal to calculate the GEP index of fields.
 pub struct GepFieldTraversal {
    /// The current GEP index.
    gep_index_counter: u32,
 }
 impl<'ctx> FieldTraversal<'ctx> for GepFieldTraversal {
    type Output<M> = GepField<M>;
    fn add<M: Model<'ctx>>(&mut self, name: &'static str, model: M) -> Self::Output<M> {
        let gep_index = self.gep_index_counter;
        self.gep_index_counter += 1;
        Self::Output { gep_index, name, model }
    }
 }
 /// A traversal to collect the field types of a struct.
 ///
 /// This is used to collect field types and construct the LLVM struct type with [`Context::struct_type`].
 struct TypeFieldTraversal<'ctx, 'a, G: CodeGenerator + ?Sized> {
    generator: &'a G,
    ctx: &'ctx Context,
    /// The collected field types so far in exact order.
    field_types: Vec<BasicTypeEnum<'ctx>>,
 }
 impl<'ctx, 'a, G: CodeGenerator + ?Sized> FieldTraversal<'ctx> for TypeFieldTraversal<'ctx, 'a, G> {
    type Output<M> = (); // Checking types return nothing.
    fn add<M: Model<'ctx>>(&mut self, _name: &'static str, model: M) -> Self::Output<M> {
        let t = model.llvm_type(self.generator, self.ctx).as_basic_type_enum();
        self.field_types.push(t);
    }
 }
 /// A traversal to check the types of fields.
 struct CheckTypeFieldTraversal<'ctx, 'a, G: CodeGenerator + ?Sized> {
    generator: &'a mut G,
    ctx: &'ctx Context,
    /// The current GEP index, so we can tell the index of the field we are checking
    /// and report the GEP index.
    gep_index_counter: u32,
    /// The [`StructType`] to check.
    scrutinee: StructType<'ctx>,
    /// The list of collected errors so far.
    errors: Vec<ModelError>,
 }
 impl<'ctx, 'a, G: CodeGenerator + ?Sized> FieldTraversal<'ctx>
    for CheckTypeFieldTraversal<'ctx, 'a, G>
 {
    type Output<M> = (); // Checking types return nothing.
    fn add<M: Model<'ctx>>(&mut self, name: &'static str, model: M) -> Self::Output<M> {
        let gep_index = self.gep_index_counter;
        self.gep_index_counter += 1;
        if let Some(t) = self.scrutinee.get_field_type_at_index(gep_index) {
            if let Err(err) = model.check_type(self.generator, self.ctx, t) {
                self.errors
                    .push(err.under_context(format!("field #{gep_index} '{name}'").as_str()));
            }
        }
        // Otherwise, it will be caught by Struct's `check_type`.
    }
 }
 /// A trait for Rust structs identifying LLVM structures.
 ///
 /// ### Example
 ///
 /// Suppose you want to define this structure:
 /// ```c
 /// template <typename T>
 /// struct ContiguousNDArray {
 ///     size_t ndims;
 ///     size_t* shape;
 ///     T* data;
 /// }
 /// ```
 ///
 /// This is how it should be done:
 /// ```ignore
 /// pub struct ContiguousNDArrayFields<'ctx, F: FieldTraversal<'ctx>, Item: Model<'ctx>> {
 ///     pub ndims: F::Out<Int<SizeT>>,
 ///     pub shape: F::Out<Ptr<Int<SizeT>>>,
 ///     pub data: F::Out<Ptr<Item>>,
 /// }
 ///
 /// /// An ndarray without strides and non-opaque `data` field in NAC3.
 /// #[derive(Debug, Clone, Copy)]
 /// pub struct ContiguousNDArray<M> {
 ///     /// [`Model`] of the items.
 ///     pub item: M,
 /// }
 ///
 /// impl<'ctx, Item: Model<'ctx>> StructKind<'ctx> for ContiguousNDArray<Item> {
 ///     type Fields<F: FieldTraversal<'ctx>> = ContiguousNDArrayFields<'ctx, F, Item>;
 ///
 ///     fn traverse_fields<F: FieldTraversal<'ctx>>(&self, traversal: &mut F) -> Self::Fields<F> {
 ///         // The order of `traversal.add*` is important
 ///         Self::Fields {
 ///             ndims: traversal.add_auto("ndims"),
 ///             shape: traversal.add_auto("shape"),
 ///             data: traversal.add("data", Ptr(self.item)),
 ///         }
 ///     }
 /// }
 /// ```
 ///
 /// The [`FieldTraversal`] here is a mechanism to allow the fields of `ContiguousNDArrayFields` to be
 /// traversed to do useful work such as:
 ///
 /// - To create the [`StructType`] of `ContiguousNDArray` by collecting [`BasicType`]s of the fields.
 /// - To enable the `.gep(ctx, |f| f.ndims).store(ctx, ...)` syntax.
 ///
 /// Suppose now that you have defined `ContiguousNDArray` and you want to allocate a `ContiguousNDArray`
 /// with dtype `float64` in LLVM, this is how you do it:
 /// ```ignore
 /// type F64NDArray = Struct<ContiguousNDArray<Float<Float64>>>; // Type alias for leaner documentation
 /// let model: F64NDArray = Struct(ContigousNDArray { item: Float(Float64) });
 /// let ndarray: Instance<'ctx, Ptr<F64NDArray>> = model.alloca(generator, ctx);
 /// ```
 ///
 /// ...and here is how you may manipulate/access `ndarray`:
 ///
 /// (NOTE: some arguments have been omitted)
 ///
 /// ```ignore
 /// // Get `&ndarray->data`
 /// ndarray.gep(|f| f.data); // type: Instance<'ctx, Ptr<Float<Float64>>>
 ///
 /// // Get `ndarray->ndims`
 /// ndarray.get(|f| f.ndims); // type: Instance<'ctx, Int<SizeT>>
 ///
 /// // Get `&ndarray->ndims`
 /// ndarray.gep(|f| f.ndims); // type: Instance<'ctx, Ptr<Int<SizeT>>>
 ///
 /// // Get `ndarray->shape[0]`
 /// ndarray.get(|f| f.shape).get_index_const(0); // Instance<'ctx, Int<SizeT>>
 ///
 /// // Get `&ndarray->shape[2]`
 /// ndarray.get(|f| f.shape).offset_const(2); // Instance<'ctx, Ptr<Int<SizeT>>>
 ///
 /// // Do `ndarray->ndims = 3;`
 /// let num_3 = Int(SizeT).const_int(3);
 /// ndarray.set(|f| f.ndims, num_3);
 /// ```
 pub trait StructKind<'ctx>: fmt::Debug + Clone + Copy {
    /// The associated fields of this struct.
    type Fields<F: FieldTraversal<'ctx>>;
    /// Traverse through all fields of this [`StructKind`].
    ///
    /// Only used internally in this module for implementing other components.
    fn iter_fields<F: FieldTraversal<'ctx>>(&self, traversal: &mut F) -> Self::Fields<F>;
    /// Get a convenience structure to get a struct field's GEP index through its corresponding Rust field.
    ///
    /// Only used internally in this module for implementing other components.
    fn fields(&self) -> Self::Fields<GepFieldTraversal> {
        self.iter_fields(&mut GepFieldTraversal { gep_index_counter: 0 })
    }
    /// Get the LLVM [`StructType`] of this [`StructKind`].
    fn get_struct_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> StructType<'ctx> {
        let mut traversal = TypeFieldTraversal { generator, ctx, field_types: Vec::new() };
        self.iter_fields(&mut traversal);
        ctx.struct_type(&traversal.field_types, false)
    }
 }
 /// A model for LLVM struct.
 ///
 /// `S` should be of a [`StructKind`].
 #[derive(Debug, Clone, Copy, Default)]
 pub struct Struct<S>(pub S);
 impl<'ctx, S: StructKind<'ctx>> Struct<S> {
    /// Create a constant struct value from its fields.
    ///
    /// This function also validates `fields` and panic when there is something wrong.
    pub fn const_struct<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        fields: &[BasicValueEnum<'ctx>],
    ) -> Instance<'ctx, Self> {
        // NOTE: There *could* have been a functor `F<M> = Instance<'ctx, M>` for `S::Fields<F>`
        // to create a more user-friendly interface, but Rust's type system is not sophisticated enough
        // and if you try doing that Rust would force you put lifetimes everywhere.
        let val = ctx.const_struct(fields, false);
        self.check_value(generator, ctx, val).unwrap()
    }
 }
 impl<'ctx, S: StructKind<'ctx>> Model<'ctx> for Struct<S> {
    type Value = StructValue<'ctx>;
    type Type = StructType<'ctx>;
    fn llvm_type<G: CodeGenerator + ?Sized>(
        &self,
        generator: &G,
        ctx: &'ctx Context,
    ) -> Self::Type {
        self.0.get_struct_type(generator, ctx)
    }
    fn check_type<T: BasicType<'ctx>, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        ty: T,
    ) -> Result<(), ModelError> {
        let ty = ty.as_basic_type_enum();
        let Ok(ty) = StructType::try_from(ty) else {
            return Err(ModelError(format!("Expecting StructType, but got {ty:?}")));
        };
        // Check each field individually.
        let mut traversal = CheckTypeFieldTraversal {
            generator,
            ctx,
            gep_index_counter: 0,
            errors: Vec::new(),
            scrutinee: ty,
        };
        self.0.iter_fields(&mut traversal);
        // Check the number of fields.
        let exp_num_fields = traversal.gep_index_counter;
        let got_num_fields = u32::try_from(ty.get_field_types().len()).unwrap();
        if exp_num_fields != got_num_fields {
            return Err(ModelError(format!(
                "Expecting StructType with {exp_num_fields} field(s), but got {got_num_fields}"
            )));
        }
        if !traversal.errors.is_empty() {
            // Currently, only the first error is reported.
            return Err(traversal.errors[0].clone());
        }
        Ok(())
    }
 }
 impl<'ctx, S: StructKind<'ctx>> Instance<'ctx, Struct<S>> {
    /// Get a field with [`StructValue::get_field_at_index`].
    pub fn get_field<G: CodeGenerator + ?Sized, M, GetField>(
        &self,
        generator: &mut G,
        ctx: &'ctx Context,
        get_field: GetField,
    ) -> Instance<'ctx, M>
    where
        M: Model<'ctx>,
        GetField: FnOnce(S::Fields<GepFieldTraversal>) -> GepField<M>,
    {
        let field = get_field(self.model.0.fields());
        let val = self.value.get_field_at_index(field.gep_index).unwrap();
        field.model.check_value(generator, ctx, val).unwrap()
    }
 }
 impl<'ctx, S: StructKind<'ctx>> Instance<'ctx, Ptr<Struct<S>>> {
    /// Get a pointer to a field with [`Builder::build_in_bounds_gep`].
    pub fn gep<M, GetField>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        get_field: GetField,
    ) -> Instance<'ctx, Ptr<M>>
    where
        M: Model<'ctx>,
        GetField: FnOnce(S::Fields<GepFieldTraversal>) -> GepField<M>,
    {
        let field = get_field(self.model.0 .0.fields());
        let llvm_i32 = ctx.ctx.i32_type();
        let ptr = unsafe {
            ctx.builder
                .build_in_bounds_gep(
                    self.value,
                    &[llvm_i32.const_zero(), llvm_i32.const_int(u64::from(field.gep_index), false)],
                    field.name,
                )
                .unwrap()
        };
        unsafe { Ptr(field.model).believe_value(ptr) }
    }
    /// Convenience function equivalent to `.gep(...).load(...)`.
    pub fn get<M, GetField, G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &CodeGenContext<'ctx, '_>,
        get_field: GetField,
    ) -> Instance<'ctx, M>
    where
        M: Model<'ctx>,
        GetField: FnOnce(S::Fields<GepFieldTraversal>) -> GepField<M>,
    {
        self.gep(ctx, get_field).load(generator, ctx)
    }
    /// Convenience function equivalent to `.gep(...).store(...)`.
    pub fn set<M, GetField>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        get_field: GetField,
        value: Instance<'ctx, M>,
    ) where
        M: Model<'ctx>,
        GetField: FnOnce(S::Fields<GepFieldTraversal>) -> GepField<M>,
    {
        self.gep(ctx, get_field).store(ctx, value);
    }
 }
--- a/nac3core/src/codegen/numpy.rs
+++ b/nac3core/src/codegen/numpy.rs
@ -6,27 +6,27 @@ use inkwell::{
 use nac3parser::ast::{Operator, StrRef};
 use super::{
    expr::gen_binop_expr_with_values,
    irrt::{
        calculate_len_for_slice_range, call_ndarray_calc_broadcast,
        call_ndarray_calc_broadcast_index, call_ndarray_calc_nd_indices, call_ndarray_calc_size,
    },
    llvm_intrinsics::{self, call_memcpy_generic},
    macros::codegen_unreachable,
    stmt::{gen_for_callback_incrementing, gen_for_range_callback, gen_if_else_expr_callback},
    types::{ListType, NDArrayType, ProxyType},
    values::{
        ArrayLikeIndexer, ArrayLikeValue, ListValue, NDArrayValue, ProxyValue,
        TypedArrayLikeAccessor, TypedArrayLikeAdapter, TypedArrayLikeMutator,
        UntypedArrayLikeAccessor, UntypedArrayLikeMutator,
    },
    CodeGenContext, CodeGenerator,
 };
 use crate::{
    codegen::{
        classes::{
            ArrayLikeIndexer, ArrayLikeValue, ListType, ListValue, NDArrayType, NDArrayValue,
            ProxyType, ProxyValue, TypedArrayLikeAccessor, TypedArrayLikeAdapter,
            TypedArrayLikeMutator, UntypedArrayLikeAccessor, UntypedArrayLikeMutator,
        },
        expr::gen_binop_expr_with_values,
        irrt::{
            calculate_len_for_slice_range, call_ndarray_calc_broadcast,
            call_ndarray_calc_broadcast_index, call_ndarray_calc_nd_indices,
            call_ndarray_calc_size,
        },
        llvm_intrinsics::{self, call_memcpy_generic},
        macros::codegen_unreachable,
        stmt::{gen_for_callback_incrementing, gen_for_range_callback, gen_if_else_expr_callback},
        CodeGenContext, CodeGenerator,
    },
    symbol_resolver::ValueEnum,
    toplevel::{
-        helper::{arraylike_flatten_element_type, PrimDef},
+        helper::PrimDef,
        numpy::{make_ndarray_ty, unpack_ndarray_var_tys},
        DefinitionId,
    },
@ -42,7 +42,6 @@ fn create_ndarray_uninitialized<'ctx, G: CodeGenerator + ?Sized>(
    ctx: &mut CodeGenContext<'ctx, '_>,
    elem_ty: Type,
 ) -> Result<NDArrayValue<'ctx>, String> {
    let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
    let ndarray_ty = make_ndarray_ty(&mut ctx.unifier, &ctx.primitives, Some(elem_ty), None);
    let llvm_usize = generator.get_size_type(ctx.ctx);
@ -55,7 +54,7 @@ fn create_ndarray_uninitialized<'ctx, G: CodeGenerator + ?Sized>(
    let ndarray = generator.gen_var_alloc(ctx, llvm_ndarray_t.into(), None)?;
-    Ok(NDArrayValue::from_pointer_value(ndarray, llvm_elem_ty, llvm_usize, None))
+    Ok(NDArrayValue::from_ptr_val(ndarray, llvm_usize, None))
 }
 /// Creates an `NDArray` instance from a dynamic shape.
@ -128,7 +127,7 @@ where
    ndarray.store_ndims(ctx, generator, num_dims);
    let ndarray_num_dims = ndarray.load_ndims(ctx);
-    ndarray.create_shape(ctx, llvm_usize, ndarray_num_dims);
+    ndarray.create_dim_sizes(ctx, llvm_usize, ndarray_num_dims);
    // Copy the dimension sizes from shape to ndarray.dims
    let shape_len = shape_len_fn(generator, ctx, shape)?;
@ -144,7 +143,7 @@ where
            let shape_dim = ctx.builder.build_int_z_extend(shape_dim, llvm_usize, "").unwrap();
            let ndarray_pdim =
-                unsafe { ndarray.shape().ptr_offset_unchecked(ctx, generator, &i, None) };
+                unsafe { ndarray.dim_sizes().ptr_offset_unchecked(ctx, generator, &i, None) };
            ctx.builder.build_store(ndarray_pdim, shape_dim).unwrap();
@ -195,12 +194,12 @@ pub fn create_ndarray_const_shape<'ctx, G: CodeGenerator + ?Sized>(
    ndarray.store_ndims(ctx, generator, num_dims);
    let ndarray_num_dims = ndarray.load_ndims(ctx);
-    ndarray.create_shape(ctx, llvm_usize, ndarray_num_dims);
+    ndarray.create_dim_sizes(ctx, llvm_usize, ndarray_num_dims);
    for (i, &shape_dim) in shape.iter().enumerate() {
        let shape_dim = ctx.builder.build_int_z_extend(shape_dim, llvm_usize, "").unwrap();
        let ndarray_dim = unsafe {
-            ndarray.shape().ptr_offset_unchecked(
+            ndarray.dim_sizes().ptr_offset_unchecked(
                ctx,
                generator,
                &llvm_usize.const_int(i as u64, true),
@ -229,7 +228,7 @@ fn ndarray_init_data<'ctx, G: CodeGenerator + ?Sized>(
    let ndarray_num_elems = call_ndarray_calc_size(
        generator,
        ctx,
-        &ndarray.shape().as_slice_value(ctx, generator),
+        &ndarray.dim_sizes().as_slice_value(ctx, generator),
        (None, None),
    );
    ndarray.create_data(ctx, llvm_ndarray_data_t, ndarray_num_elems);
@ -315,11 +314,11 @@ fn call_ndarray_empty_impl<'ctx, G: CodeGenerator + ?Sized>(
    match shape {
        BasicValueEnum::PointerValue(shape_list_ptr)
-            if ListValue::is_representable(shape_list_ptr, llvm_usize).is_ok() =>
+            if ListValue::is_instance(shape_list_ptr, llvm_usize).is_ok() =>
        {
            // 1. A list of ints; e.g., `np.empty([600, 800, 3])`
-            let shape_list = ListValue::from_pointer_value(shape_list_ptr, llvm_usize, None);
+            let shape_list = ListValue::from_ptr_val(shape_list_ptr, llvm_usize, None);
            create_ndarray_dyn_shape(
                generator,
                ctx,
@ -380,7 +379,7 @@ where
    let ndarray_num_elems = call_ndarray_calc_size(
        generator,
        ctx,
-        &ndarray.shape().as_slice_value(ctx, generator),
+        &ndarray.dim_sizes().as_slice_value(ctx, generator),
        (None, None),
    );
@ -474,8 +473,8 @@ fn ndarray_broadcast_fill<'ctx, 'a, G, ValueFn>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, 'a>,
    res: NDArrayValue<'ctx>,
-    lhs: (Type, BasicValueEnum<'ctx>, bool),
+    lhs: (BasicValueEnum<'ctx>, bool),
-    rhs: (Type, BasicValueEnum<'ctx>, bool),
+    rhs: (BasicValueEnum<'ctx>, bool),
    value_fn: ValueFn,
 ) -> Result<NDArrayValue<'ctx>, String>
 where
@ -488,8 +487,8 @@ where
 {
    let llvm_usize = generator.get_size_type(ctx.ctx);
-    let (lhs_ty, lhs_val, lhs_scalar) = lhs;
+    let (lhs_val, lhs_scalar) = lhs;
-    let (rhs_ty, rhs_val, rhs_scalar) = rhs;
+    let (rhs_val, rhs_scalar) = rhs;
    assert!(
        !(lhs_scalar && rhs_scalar),
@ -500,26 +499,12 @@ where
    // Assert that all ndarray operands are broadcastable to the target size
    if !lhs_scalar {
-        let lhs_dtype = arraylike_flatten_element_type(&mut ctx.unifier, lhs_ty);
+        let lhs_val = NDArrayValue::from_ptr_val(lhs_val.into_pointer_value(), llvm_usize, None);
        let llvm_lhs_elem_ty = ctx.get_llvm_type(generator, lhs_dtype);
        let lhs_val = NDArrayValue::from_pointer_value(
            lhs_val.into_pointer_value(),
            llvm_lhs_elem_ty,
            llvm_usize,
            None,
        );
        ndarray_assert_is_broadcastable(generator, ctx, res, lhs_val);
    }
    if !rhs_scalar {
-        let rhs_dtype = arraylike_flatten_element_type(&mut ctx.unifier, rhs_ty);
+        let rhs_val = NDArrayValue::from_ptr_val(rhs_val.into_pointer_value(), llvm_usize, None);
        let llvm_rhs_elem_ty = ctx.get_llvm_type(generator, rhs_dtype);
        let rhs_val = NDArrayValue::from_pointer_value(
            rhs_val.into_pointer_value(),
            llvm_rhs_elem_ty,
            llvm_usize,
            None,
        );
        ndarray_assert_is_broadcastable(generator, ctx, res, rhs_val);
    }
@ -527,14 +512,7 @@ where
        let lhs_elem = if lhs_scalar {
            lhs_val
        } else {
-            let lhs_dtype = arraylike_flatten_element_type(&mut ctx.unifier, lhs_ty);
+            let lhs = NDArrayValue::from_ptr_val(lhs_val.into_pointer_value(), llvm_usize, None);
            let llvm_lhs_elem_ty = ctx.get_llvm_type(generator, lhs_dtype);
            let lhs = NDArrayValue::from_pointer_value(
                lhs_val.into_pointer_value(),
                llvm_lhs_elem_ty,
                llvm_usize,
                None,
            );
            let lhs_idx = call_ndarray_calc_broadcast_index(generator, ctx, lhs, idx);
            unsafe { lhs.data().get_unchecked(ctx, generator, &lhs_idx, None) }
@ -543,14 +521,7 @@ where
        let rhs_elem = if rhs_scalar {
            rhs_val
        } else {
-            let rhs_dtype = arraylike_flatten_element_type(&mut ctx.unifier, rhs_ty);
+            let rhs = NDArrayValue::from_ptr_val(rhs_val.into_pointer_value(), llvm_usize, None);
            let llvm_rhs_elem_ty = ctx.get_llvm_type(generator, rhs_dtype);
            let rhs = NDArrayValue::from_pointer_value(
                rhs_val.into_pointer_value(),
                llvm_rhs_elem_ty,
                llvm_usize,
                None,
            );
            let rhs_idx = call_ndarray_calc_broadcast_index(generator, ctx, rhs, idx);
            unsafe { rhs.data().get_unchecked(ctx, generator, &rhs_idx, None) }
@ -676,15 +647,11 @@ fn llvm_ndlist_get_ndims<'ctx, G: CodeGenerator + ?Sized>(
    let ndims = llvm_usize.const_int(1, false);
    match list_elem_ty {
-        AnyTypeEnum::PointerType(ptr_ty)
+        AnyTypeEnum::PointerType(ptr_ty) if ListType::is_type(ptr_ty, llvm_usize).is_ok() => {
            if ListType::is_representable(ptr_ty, llvm_usize).is_ok() =>
        {
            ndims.const_add(llvm_ndlist_get_ndims(generator, ctx, ptr_ty))
        }
-        AnyTypeEnum::PointerType(ptr_ty)
+        AnyTypeEnum::PointerType(ptr_ty) if NDArrayType::is_type(ptr_ty, llvm_usize).is_ok() => {
            if NDArrayType::is_representable(ptr_ty, llvm_usize).is_ok() =>
        {
            todo!("Getting ndims for list[ndarray] not supported")
        }
@ -696,20 +663,16 @@ fn llvm_ndlist_get_ndims<'ctx, G: CodeGenerator + ?Sized>(
 fn llvm_arraylike_get_ndims<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
-    (ty, value): (Type, BasicValueEnum<'ctx>),
+    value: BasicValueEnum<'ctx>,
 ) -> IntValue<'ctx> {
    let llvm_usize = generator.get_size_type(ctx.ctx);
    match value {
-        BasicValueEnum::PointerValue(v)
+        BasicValueEnum::PointerValue(v) if NDArrayValue::is_instance(v, llvm_usize).is_ok() => {
-            if NDArrayValue::is_representable(v, llvm_usize).is_ok() =>
+            NDArrayValue::from_ptr_val(v, llvm_usize, None).load_ndims(ctx)
        {
            let dtype = arraylike_flatten_element_type(&mut ctx.unifier, ty);
            let llvm_elem_ty = ctx.get_llvm_type(generator, dtype);
            NDArrayValue::from_pointer_value(v, llvm_elem_ty, llvm_usize, None).load_ndims(ctx)
        }
-        BasicValueEnum::PointerValue(v) if ListValue::is_representable(v, llvm_usize).is_ok() => {
+        BasicValueEnum::PointerValue(v) if ListValue::is_instance(v, llvm_usize).is_ok() => {
            llvm_ndlist_get_ndims(generator, ctx, v.get_type())
        }
@ -721,6 +684,7 @@ fn llvm_arraylike_get_ndims<'ctx, G: CodeGenerator + ?Sized>(
 fn ndarray_from_ndlist_impl<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    elem_ty: Type,
    (dst_arr, dst_slice_ptr): (NDArrayValue<'ctx>, PointerValue<'ctx>),
    src_lst: ListValue<'ctx>,
    dim: u64,
@ -731,15 +695,13 @@ fn ndarray_from_ndlist_impl<'ctx, G: CodeGenerator + ?Sized>(
    let list_elem_ty = src_lst.get_type().element_type();
    match list_elem_ty {
-        AnyTypeEnum::PointerType(ptr_ty)
+        AnyTypeEnum::PointerType(ptr_ty) if ListType::is_type(ptr_ty, llvm_usize).is_ok() => {
            if ListType::is_representable(ptr_ty, llvm_usize).is_ok() =>
        {
            // The stride of elements in this dimension, i.e. the number of elements between arr[i]
            // and arr[i + 1] in this dimension
            let stride = call_ndarray_calc_size(
                generator,
                ctx,
-                &dst_arr.shape(),
+                &dst_arr.dim_sizes(),
                (Some(llvm_usize.const_int(dim + 1, false)), None),
            );
@ -753,25 +715,11 @@ fn ndarray_from_ndlist_impl<'ctx, G: CodeGenerator + ?Sized>(
                |_, _| Ok(llvm_usize.const_int(1, false)),
                |generator, ctx, _, i| {
                    let offset = ctx.builder.build_int_mul(stride, i, "").unwrap();
                    let offset = ctx
                        .builder
                        .build_int_mul(
                            offset,
                            ctx.builder
                                .build_int_truncate_or_bit_cast(
                                    dst_arr.get_type().element_type().size_of().unwrap(),
                                    offset.get_type(),
                                    "",
                                )
                                .unwrap(),
                            "",
                        )
                        .unwrap();
                    let dst_ptr =
                        unsafe { ctx.builder.build_gep(dst_slice_ptr, &[offset], "").unwrap() };
-                    let nested_lst_elem = ListValue::from_pointer_value(
+                    let nested_lst_elem = ListValue::from_ptr_val(
                        unsafe { src_lst.data().get_unchecked(ctx, generator, &i, None) }
                            .into_pointer_value(),
                        llvm_usize,
@ -781,6 +729,7 @@ fn ndarray_from_ndlist_impl<'ctx, G: CodeGenerator + ?Sized>(
                    ndarray_from_ndlist_impl(
                        generator,
                        ctx,
                        elem_ty,
                        (dst_arr, dst_ptr),
                        nested_lst_elem,
                        dim + 1,
@ -791,15 +740,13 @@ fn ndarray_from_ndlist_impl<'ctx, G: CodeGenerator + ?Sized>(
            )?;
        }
-        AnyTypeEnum::PointerType(ptr_ty)
+        AnyTypeEnum::PointerType(ptr_ty) if NDArrayType::is_type(ptr_ty, llvm_usize).is_ok() => {
            if NDArrayType::is_representable(ptr_ty, llvm_usize).is_ok() =>
        {
            todo!("Not implemented for list[ndarray]")
        }
        _ => {
            let lst_len = src_lst.load_size(ctx, None);
-            let sizeof_elem = dst_arr.get_type().element_type().size_of().unwrap();
+            let sizeof_elem = ctx.get_llvm_type(generator, elem_ty).size_of().unwrap();
            let sizeof_elem = ctx.builder.build_int_cast(sizeof_elem, llvm_usize, "").unwrap();
            let cpy_len = ctx
@ -854,9 +801,8 @@ fn call_ndarray_array_impl<'ctx, G: CodeGenerator + ?Sized>(
    let object = object.into_pointer_value();
    // object is an NDArray instance - copy object unless copy=0 && ndmin < object.ndims
-    if NDArrayValue::is_representable(object, llvm_usize).is_ok() {
+    if NDArrayValue::is_instance(object, llvm_usize).is_ok() {
-        let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
+        let object = NDArrayValue::from_ptr_val(object, llvm_usize, None);
        let object = NDArrayValue::from_pointer_value(object, llvm_elem_ty, llvm_usize, None);
        let ndarray = gen_if_else_expr_callback(
            generator,
@ -918,6 +864,7 @@ fn call_ndarray_array_impl<'ctx, G: CodeGenerator + ?Sized>(
                ndarray_sliced_copyto_impl(
                    generator,
                    ctx,
                    elem_ty,
                    (ndarray, ndarray.data().base_ptr(ctx, generator)),
                    (object, object.data().base_ptr(ctx, generator)),
                    0,
@ -929,17 +876,16 @@ fn call_ndarray_array_impl<'ctx, G: CodeGenerator + ?Sized>(
            |_, _| Ok(Some(object.as_base_value())),
        )?;
-        return Ok(NDArrayValue::from_pointer_value(
+        return Ok(NDArrayValue::from_ptr_val(
            ndarray.map(BasicValueEnum::into_pointer_value).unwrap(),
            llvm_elem_ty,
            llvm_usize,
            None,
        ));
    }
    // Remaining case: TList
-    assert!(ListValue::is_representable(object, llvm_usize).is_ok());
+    assert!(ListValue::is_instance(object, llvm_usize).is_ok());
-    let object = ListValue::from_pointer_value(object, llvm_usize, None);
+    let object = ListValue::from_ptr_val(object, llvm_usize, None);
    // The number of dimensions to prepend 1's to
    let ndims = llvm_ndlist_get_ndims(generator, ctx, object.as_base_value().get_type());
@ -1019,8 +965,7 @@ fn call_ndarray_array_impl<'ctx, G: CodeGenerator + ?Sized>(
                                .map(|v| ctx.builder.build_bit_cast(v, plist_plist_i8, "").unwrap())
                                .map(BasicValueEnum::into_pointer_value)
                                .unwrap();
-                            let this_dim =
+                            let this_dim = ListValue::from_ptr_val(this_dim, llvm_usize, None);
                                ListValue::from_pointer_value(this_dim, llvm_usize, None);
                            // TODO: Assert this_dim.sz != 0
@ -1046,7 +991,7 @@ fn call_ndarray_array_impl<'ctx, G: CodeGenerator + ?Sized>(
                        },
                    )?;
-                    let lst = ListValue::from_pointer_value(
+                    let lst = ListValue::from_ptr_val(
                        ctx.builder
                            .build_load(lst, "")
                            .map(BasicValueEnum::into_pointer_value)
@ -1066,6 +1011,7 @@ fn call_ndarray_array_impl<'ctx, G: CodeGenerator + ?Sized>(
    ndarray_from_ndlist_impl(
        generator,
        ctx,
        elem_ty,
        (ndarray, ndarray.data().base_ptr(ctx, generator)),
        object,
        0,
@ -1138,6 +1084,7 @@ fn call_ndarray_eye_impl<'ctx, G: CodeGenerator + ?Sized>(
 fn ndarray_sliced_copyto_impl<'ctx, G: CodeGenerator + ?Sized>(
    generator: &mut G,
    ctx: &mut CodeGenContext<'ctx, '_>,
    elem_ty: Type,
    (dst_arr, dst_slice_ptr): (NDArrayValue<'ctx>, PointerValue<'ctx>),
    (src_arr, src_slice_ptr): (NDArrayValue<'ctx>, PointerValue<'ctx>),
    dim: u64,
@ -1146,16 +1093,14 @@ fn ndarray_sliced_copyto_impl<'ctx, G: CodeGenerator + ?Sized>(
    let llvm_i1 = ctx.ctx.bool_type();
    let llvm_usize = generator.get_size_type(ctx.ctx);
    assert_eq!(dst_arr.get_type().element_type(), src_arr.get_type().element_type());
    let sizeof_elem = dst_arr.get_type().element_type().size_of().unwrap();
    // If there are no (remaining) slice expressions, memcpy the entire dimension
    if slices.is_empty() {
        let sizeof_elem = ctx.get_llvm_type(generator, elem_ty).size_of().unwrap();
        let stride = call_ndarray_calc_size(
            generator,
            ctx,
-            &src_arr.shape(),
+            &src_arr.dim_sizes(),
            (Some(llvm_usize.const_int(dim, false)), None),
        );
        let stride =
@ -1173,13 +1118,13 @@ fn ndarray_sliced_copyto_impl<'ctx, G: CodeGenerator + ?Sized>(
    let src_stride = call_ndarray_calc_size(
        generator,
        ctx,
-        &src_arr.shape(),
+        &src_arr.dim_sizes(),
        (Some(llvm_usize.const_int(dim + 1, false)), None),
    );
    let dst_stride = call_ndarray_calc_size(
        generator,
        ctx,
-        &dst_arr.shape(),
+        &dst_arr.dim_sizes(),
        (Some(llvm_usize.const_int(dim + 1, false)), None),
    );
@ -1202,29 +1147,9 @@ fn ndarray_sliced_copyto_impl<'ctx, G: CodeGenerator + ?Sized>(
        |generator, ctx, _, src_i| {
            // Calculate the offset of the active slice
            let src_data_offset = ctx.builder.build_int_mul(src_stride, src_i, "").unwrap();
            let src_data_offset = ctx
                .builder
                .build_int_mul(
                    src_data_offset,
                    ctx.builder
                        .build_int_cast(sizeof_elem, src_data_offset.get_type(), "")
                        .unwrap(),
                    "",
                )
                .unwrap();
            let dst_i =
                ctx.builder.build_load(dst_i_addr, "").map(BasicValueEnum::into_int_value).unwrap();
            let dst_data_offset = ctx.builder.build_int_mul(dst_stride, dst_i, "").unwrap();
            let dst_data_offset = ctx
                .builder
                .build_int_mul(
                    dst_data_offset,
                    ctx.builder
                        .build_int_cast(sizeof_elem, dst_data_offset.get_type(), "")
                        .unwrap(),
                    "",
                )
                .unwrap();
            let (src_ptr, dst_ptr) = unsafe {
                (
@ -1236,6 +1161,7 @@ fn ndarray_sliced_copyto_impl<'ctx, G: CodeGenerator + ?Sized>(
            ndarray_sliced_copyto_impl(
                generator,
                ctx,
                elem_ty,
                (dst_arr, dst_ptr),
                (src_arr, src_ptr),
                dim + 1,
@ -1278,7 +1204,7 @@ pub fn ndarray_sliced_copy<'ctx, G: CodeGenerator + ?Sized>(
            &this,
            |_, ctx, shape| Ok(shape.load_ndims(ctx)),
            |generator, ctx, shape, idx| unsafe {
-                Ok(shape.shape().get_typed_unchecked(ctx, generator, &idx, None))
+                Ok(shape.dim_sizes().get_typed_unchecked(ctx, generator, &idx, None))
            },
        )?
    } else {
@ -1286,7 +1212,7 @@ pub fn ndarray_sliced_copy<'ctx, G: CodeGenerator + ?Sized>(
        ndarray.store_ndims(ctx, generator, this.load_ndims(ctx));
        let ndims = this.load_ndims(ctx);
-        ndarray.create_shape(ctx, llvm_usize, ndims);
+        ndarray.create_dim_sizes(ctx, llvm_usize, ndims);
        // Populate the first slices.len() dimensions by computing the size of each dim slice
        for (i, (start, stop, step)) in slices.iter().enumerate() {
@ -1318,7 +1244,7 @@ pub fn ndarray_sliced_copy<'ctx, G: CodeGenerator + ?Sized>(
                ctx.builder.build_int_z_extend_or_bit_cast(slice_len, llvm_usize, "").unwrap();
            unsafe {
-                ndarray.shape().set_typed_unchecked(
+                ndarray.dim_sizes().set_typed_unchecked(
                    ctx,
                    generator,
                    &llvm_usize.const_int(i as u64, false),
@ -1336,8 +1262,8 @@ pub fn ndarray_sliced_copy<'ctx, G: CodeGenerator + ?Sized>(
            (this.load_ndims(ctx), false),
            |generator, ctx, _, idx| {
                unsafe {
-                    let dim_sz = this.shape().get_typed_unchecked(ctx, generator, &idx, None);
+                    let dim_sz = this.dim_sizes().get_typed_unchecked(ctx, generator, &idx, None);
-                    ndarray.shape().set_typed_unchecked(ctx, generator, &idx, dim_sz);
+                    ndarray.dim_sizes().set_typed_unchecked(ctx, generator, &idx, dim_sz);
                }
                Ok(())
@ -1352,6 +1278,7 @@ pub fn ndarray_sliced_copy<'ctx, G: CodeGenerator + ?Sized>(
    ndarray_sliced_copyto_impl(
        generator,
        ctx,
        elem_ty,
        (ndarray, ndarray.data().base_ptr(ctx, generator)),
        (this, this.data().base_ptr(ctx, generator)),
        0,
@ -1397,7 +1324,7 @@ where
            &operand,
            |_, ctx, v| Ok(v.load_ndims(ctx)),
            |generator, ctx, v, idx| unsafe {
-                Ok(v.shape().get_typed_unchecked(ctx, generator, &idx, None))
+                Ok(v.dim_sizes().get_typed_unchecked(ctx, generator, &idx, None))
            },
        )
        .unwrap()
@ -1434,8 +1361,8 @@ pub fn ndarray_elementwise_binop_impl<'ctx, 'a, G, ValueFn>(
    ctx: &mut CodeGenContext<'ctx, 'a>,
    elem_ty: Type,
    res: Option<NDArrayValue<'ctx>>,
-    lhs: (Type, BasicValueEnum<'ctx>, bool),
+    lhs: (BasicValueEnum<'ctx>, bool),
-    rhs: (Type, BasicValueEnum<'ctx>, bool),
+    rhs: (BasicValueEnum<'ctx>, bool),
    value_fn: ValueFn,
 ) -> Result<NDArrayValue<'ctx>, String>
 where
@ -1448,8 +1375,8 @@ where
 {
    let llvm_usize = generator.get_size_type(ctx.ctx);
-    let (lhs_ty, lhs_val, lhs_scalar) = lhs;
+    let (lhs_val, lhs_scalar) = lhs;
-    let (rhs_ty, rhs_val, rhs_scalar) = rhs;
+    let (rhs_val, rhs_scalar) = rhs;
    assert!(
        !(lhs_scalar && rhs_scalar),
@ -1460,22 +1387,10 @@ where
    let ndarray = res.unwrap_or_else(|| {
        if lhs_scalar && rhs_scalar {
-            let lhs_dtype = arraylike_flatten_element_type(&mut ctx.unifier, lhs_ty);
+            let lhs_val =
-            let llvm_lhs_elem_ty = ctx.get_llvm_type(generator, lhs_dtype);
+                NDArrayValue::from_ptr_val(lhs_val.into_pointer_value(), llvm_usize, None);
-            let lhs_val = NDArrayValue::from_pointer_value(
+            let rhs_val =
-                lhs_val.into_pointer_value(),
+                NDArrayValue::from_ptr_val(rhs_val.into_pointer_value(), llvm_usize, None);
                llvm_lhs_elem_ty,
                llvm_usize,
                None,
            );
            let rhs_dtype = arraylike_flatten_element_type(&mut ctx.unifier, rhs_ty);
            let llvm_rhs_elem_ty = ctx.get_llvm_type(generator, rhs_dtype);
            let rhs_val = NDArrayValue::from_pointer_value(
                rhs_val.into_pointer_value(),
                llvm_rhs_elem_ty,
                llvm_usize,
                None,
            );
            let ndarray_dims = call_ndarray_calc_broadcast(generator, ctx, lhs_val, rhs_val);
@ -1491,14 +1406,8 @@ where
            )
            .unwrap()
        } else {
-            let dtype = arraylike_flatten_element_type(
+            let ndarray = NDArrayValue::from_ptr_val(
                &mut ctx.unifier,
                if lhs_scalar { rhs_ty } else { lhs_ty },
            );
            let llvm_elem_ty = ctx.get_llvm_type(generator, dtype);
            let ndarray = NDArrayValue::from_pointer_value(
                if lhs_scalar { rhs_val } else { lhs_val }.into_pointer_value(),
                llvm_elem_ty,
                llvm_usize,
                None,
            );
@ -1510,7 +1419,7 @@ where
                &ndarray,
                |_, ctx, v| Ok(v.load_ndims(ctx)),
                |generator, ctx, v, idx| unsafe {
-                    Ok(v.shape().get_typed_unchecked(ctx, generator, &idx, None))
+                    Ok(v.dim_sizes().get_typed_unchecked(ctx, generator, &idx, None))
                },
            )
            .unwrap()
@ -1571,10 +1480,10 @@ pub fn ndarray_matmul_2d<'ctx, G: CodeGenerator>(
        if let Some(res) = res {
            let res_ndims = res.load_ndims(ctx);
            let res_dim0 = unsafe {
-                res.shape().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
+                res.dim_sizes().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
            };
            let res_dim1 = unsafe {
-                res.shape().get_typed_unchecked(
+                res.dim_sizes().get_typed_unchecked(
                    ctx,
                    generator,
                    &llvm_usize.const_int(1, false),
@ -1582,10 +1491,10 @@ pub fn ndarray_matmul_2d<'ctx, G: CodeGenerator>(
                )
            };
            let lhs_dim0 = unsafe {
-                lhs.shape().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
+                lhs.dim_sizes().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
            };
            let rhs_dim1 = unsafe {
-                rhs.shape().get_typed_unchecked(
+                rhs.dim_sizes().get_typed_unchecked(
                    ctx,
                    generator,
                    &llvm_usize.const_int(1, false),
@ -1634,10 +1543,15 @@ pub fn ndarray_matmul_2d<'ctx, G: CodeGenerator>(
    if ctx.registry.llvm_options.opt_level == OptimizationLevel::None {
        let lhs_dim1 = unsafe {
-            lhs.shape().get_typed_unchecked(ctx, generator, &llvm_usize.const_int(1, false), None)
+            lhs.dim_sizes().get_typed_unchecked(
                ctx,
                generator,
                &llvm_usize.const_int(1, false),
                None,
            )
        };
        let rhs_dim0 = unsafe {
-            rhs.shape().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
+            rhs.dim_sizes().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
        };
        // lhs.dims[1] == rhs.dims[0]
@ -1676,7 +1590,7 @@ pub fn ndarray_matmul_2d<'ctx, G: CodeGenerator>(
                    },
                    |generator, ctx| {
                        Ok(Some(unsafe {
-                            lhs.shape().get_typed_unchecked(
+                            lhs.dim_sizes().get_typed_unchecked(
                                ctx,
                                generator,
                                &llvm_usize.const_zero(),
@ -1686,7 +1600,7 @@ pub fn ndarray_matmul_2d<'ctx, G: CodeGenerator>(
                    },
                    |generator, ctx| {
                        Ok(Some(unsafe {
-                            rhs.shape().get_typed_unchecked(
+                            rhs.dim_sizes().get_typed_unchecked(
                                ctx,
                                generator,
                                &llvm_usize.const_int(1, false),
@ -1713,7 +1627,7 @@ pub fn ndarray_matmul_2d<'ctx, G: CodeGenerator>(
        let common_dim = {
            let lhs_idx1 = unsafe {
-                lhs.shape().get_typed_unchecked(
+                lhs.dim_sizes().get_typed_unchecked(
                    ctx,
                    generator,
                    &llvm_usize.const_int(1, false),
@ -1721,7 +1635,7 @@ pub fn ndarray_matmul_2d<'ctx, G: CodeGenerator>(
                )
            };
            let rhs_idx0 = unsafe {
-                rhs.shape().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
+                rhs.dim_sizes().get_typed_unchecked(ctx, generator, &llvm_usize.const_zero(), None)
            };
            let idx = llvm_intrinsics::call_expect(ctx, rhs_idx0, lhs_idx1, None);
@ -2052,18 +1966,11 @@ pub fn gen_ndarray_copy<'ctx>(
    let this_arg =
        obj.as_ref().unwrap().1.clone().to_basic_value_enum(context, generator, this_ty)?;
    let llvm_elem_ty = context.get_llvm_type(generator, this_elem_ty);
    ndarray_copy_impl(
        generator,
        context,
        this_elem_ty,
-        NDArrayValue::from_pointer_value(
+        NDArrayValue::from_ptr_val(this_arg.into_pointer_value(), llvm_usize, None),
            this_arg.into_pointer_value(),
            llvm_elem_ty,
            llvm_usize,
            None,
        ),
    )
    .map(NDArrayValue::into)
 }
@ -2082,7 +1989,6 @@ pub fn gen_ndarray_fill<'ctx>(
    let llvm_usize = generator.get_size_type(context.ctx);
    let this_ty = obj.as_ref().unwrap().0;
    let this_elem_ty = arraylike_flatten_element_type(&mut context.unifier, this_ty);
    let this_arg = obj
        .as_ref()
        .unwrap()
@ -2093,12 +1999,10 @@ pub fn gen_ndarray_fill<'ctx>(
    let value_ty = fun.0.args[0].ty;
    let value_arg = args[0].1.clone().to_basic_value_enum(context, generator, value_ty)?;
    let llvm_elem_ty = context.get_llvm_type(generator, this_elem_ty);
    ndarray_fill_flattened(
        generator,
        context,
-        NDArrayValue::from_pointer_value(this_arg, llvm_elem_ty, llvm_usize, None),
+        NDArrayValue::from_ptr_val(this_arg, llvm_usize, None),
        |generator, ctx, _| {
            let value = if value_arg.is_pointer_value() {
                let llvm_i1 = ctx.ctx.bool_type();
@ -2139,9 +2043,8 @@ pub fn ndarray_transpose<'ctx, G: CodeGenerator + ?Sized>(
    if let BasicValueEnum::PointerValue(n1) = x1 {
        let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, x1_ty);
-        let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
-        let n1 = NDArrayValue::from_pointer_value(n1, llvm_elem_ty, llvm_usize, None);
+        let n_sz = call_ndarray_calc_size(generator, ctx, &n1.dim_sizes(), (None, None));
        let n_sz = call_ndarray_calc_size(generator, ctx, &n1.shape(), (None, None));
        // Dimensions are reversed in the transposed array
        let out = create_ndarray_dyn_shape(
@ -2156,7 +2059,7 @@ pub fn ndarray_transpose<'ctx, G: CodeGenerator + ?Sized>(
                    .builder
                    .build_int_sub(new_idx, new_idx.get_type().const_int(1, false), "")
                    .unwrap();
-                unsafe { Ok(n.shape().get_typed_unchecked(ctx, generator, &new_idx, None)) }
+                unsafe { Ok(n.dim_sizes().get_typed_unchecked(ctx, generator, &new_idx, None)) }
            },
        )
        .unwrap();
@ -2193,7 +2096,7 @@ pub fn ndarray_transpose<'ctx, G: CodeGenerator + ?Sized>(
                            .build_int_sub(ndim_rev, llvm_usize.const_int(1, false), "")
                            .unwrap();
                        let dim = unsafe {
-                            n1.shape().get_typed_unchecked(ctx, generator, &ndim_rev, None)
+                            n1.dim_sizes().get_typed_unchecked(ctx, generator, &ndim_rev, None)
                        };
                        let rem_idx_val =
@ -2259,9 +2162,8 @@ pub fn ndarray_reshape<'ctx, G: CodeGenerator + ?Sized>(
    if let BasicValueEnum::PointerValue(n1) = x1 {
        let (elem_ty, _) = unpack_ndarray_var_tys(&mut ctx.unifier, x1_ty);
-        let llvm_elem_ty = ctx.get_llvm_type(generator, elem_ty);
+        let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
-        let n1 = NDArrayValue::from_pointer_value(n1, llvm_elem_ty, llvm_usize, None);
+        let n_sz = call_ndarray_calc_size(generator, ctx, &n1.dim_sizes(), (None, None));
        let n_sz = call_ndarray_calc_size(generator, ctx, &n1.shape(), (None, None));
        let acc = generator.gen_var_alloc(ctx, llvm_usize.into(), None)?;
        let num_neg = generator.gen_var_alloc(ctx, llvm_usize.into(), None)?;
@ -2270,11 +2172,11 @@ pub fn ndarray_reshape<'ctx, G: CodeGenerator + ?Sized>(
        let out = match shape {
            BasicValueEnum::PointerValue(shape_list_ptr)
-                if ListValue::is_representable(shape_list_ptr, llvm_usize).is_ok() =>
+                if ListValue::is_instance(shape_list_ptr, llvm_usize).is_ok() =>
            {
                // 1. A list of ints; e.g., `np.reshape(arr, [int64(600), int64(800, -1])`
-                let shape_list = ListValue::from_pointer_value(shape_list_ptr, llvm_usize, None);
+                let shape_list = ListValue::from_ptr_val(shape_list_ptr, llvm_usize, None);
                // Check for -1 in dimensions
                gen_for_callback_incrementing(
                    generator,
@ -2489,7 +2391,7 @@ pub fn ndarray_reshape<'ctx, G: CodeGenerator + ?Sized>(
        );
        // The new shape must be compatible with the old shape
-        let out_sz = call_ndarray_calc_size(generator, ctx, &out.shape(), (None, None));
+        let out_sz = call_ndarray_calc_size(generator, ctx, &out.dim_sizes(), (None, None));
        ctx.make_assert(
            generator,
            ctx.builder.build_int_compare(IntPredicate::EQ, out_sz, n_sz, "").unwrap(),
@ -2537,22 +2439,17 @@ pub fn ndarray_dot<'ctx, G: CodeGenerator + ?Sized>(
 ) -> Result<BasicValueEnum<'ctx>, String> {
    const FN_NAME: &str = "ndarray_dot";
    let (x1_ty, x1) = x1;
-    let (x2_ty, x2) = x2;
+    let (_, x2) = x2;
    let llvm_usize = generator.get_size_type(ctx.ctx);
    match (x1, x2) {
        (BasicValueEnum::PointerValue(n1), BasicValueEnum::PointerValue(n2)) => {
-            let n1_dtype = arraylike_flatten_element_type(&mut ctx.unifier, x1_ty);
+            let n1 = NDArrayValue::from_ptr_val(n1, llvm_usize, None);
-            let n2_dtype = arraylike_flatten_element_type(&mut ctx.unifier, x2_ty);
+            let n2 = NDArrayValue::from_ptr_val(n2, llvm_usize, None);
            let llvm_n1_data_ty = ctx.get_llvm_type(generator, n1_dtype);
            let llvm_n2_data_ty = ctx.get_llvm_type(generator, n2_dtype);
-            let n1 = NDArrayValue::from_pointer_value(n1, llvm_n1_data_ty, llvm_usize, None);
+            let n1_sz = call_ndarray_calc_size(generator, ctx, &n1.dim_sizes(), (None, None));
-            let n2 = NDArrayValue::from_pointer_value(n2, llvm_n2_data_ty, llvm_usize, None);
+            let n2_sz = call_ndarray_calc_size(generator, ctx, &n1.dim_sizes(), (None, None));
            let n1_sz = call_ndarray_calc_size(generator, ctx, &n1.shape(), (None, None));
            let n2_sz = call_ndarray_calc_size(generator, ctx, &n1.shape(), (None, None));
            ctx.make_assert(
                generator,
@ -2589,7 +2486,7 @@ pub fn ndarray_dot<'ctx, G: CodeGenerator + ?Sized>(
                            .build_float_mul(e1, elem2.into_float_value(), "")
                            .unwrap()
                            .as_basic_value_enum(),
-                        _ => codegen_unreachable!(ctx, "product: {}", elem1.get_type()),
+                        _ => codegen_unreachable!(ctx),
                    };
                    let acc_val = ctx.builder.build_load(acc, "").unwrap();
                    let acc_val = match acc_val {
@ -2603,7 +2500,7 @@ pub fn ndarray_dot<'ctx, G: CodeGenerator + ?Sized>(
                            .build_float_add(e1, product.into_float_value(), "")
                            .unwrap()
                            .as_basic_value_enum(),
-                        _ => codegen_unreachable!(ctx, "acc_val: {}", acc_val.get_type()),
+                        _ => codegen_unreachable!(ctx),
                    };
                    ctx.builder.build_store(acc, acc_val).unwrap();
--- a/nac3core/src/codegen/stmt.rs
+++ b/nac3core/src/codegen/stmt.rs
@ -12,11 +12,11 @@ use nac3parser::ast::{
 };
 use super::{
    classes::{ArrayLikeIndexer, ArraySliceValue, ListValue, RangeValue},
    expr::{destructure_range, gen_binop_expr},
    gen_in_range_check,
    irrt::{handle_slice_indices, list_slice_assignment},
    macros::codegen_unreachable,
    values::{ArrayLikeIndexer, ArraySliceValue, ListValue, RangeValue},
    CodeGenContext, CodeGenerator,
 };
 use crate::{
@ -310,7 +310,7 @@ pub fn gen_setitem<'ctx, G: CodeGenerator>(
                .unwrap()
                .to_basic_value_enum(ctx, generator, target_ty)?
                .into_pointer_value();
-            let target = ListValue::from_pointer_value(target, llvm_usize, None);
+            let target = ListValue::from_ptr_val(target, llvm_usize, None);
            if let ExprKind::Slice { .. } = &key.node {
                // Handle assigning to a slice
@ -331,7 +331,7 @@ pub fn gen_setitem<'ctx, G: CodeGenerator>(
                let value =
                    value.to_basic_value_enum(ctx, generator, value_ty)?.into_pointer_value();
-                let value = ListValue::from_pointer_value(value, llvm_usize, None);
+                let value = ListValue::from_ptr_val(value, llvm_usize, None);
                let target_item_ty = ctx.get_llvm_type(generator, target_item_ty);
                let Some(src_ind) = handle_slice_indices(
@ -463,8 +463,7 @@ pub fn gen_for<G: CodeGenerator>(
        TypeEnum::TObj { obj_id, .. }
            if *obj_id == ctx.primitives.range.obj_id(&ctx.unifier).unwrap() =>
        {
-            let iter_val =
+            let iter_val = RangeValue::from_ptr_val(iter_val.into_pointer_value(), Some("range"));
                RangeValue::from_pointer_value(iter_val.into_pointer_value(), Some("range"));
            // Internal variable for loop; Cannot be assigned
            let i = generator.gen_var_alloc(ctx, int32.into(), Some("for.i.addr"))?;
            // Variable declared in "target" expression of the loop; Can be reassigned *or* shadowed
--- a/nac3core/src/codegen/test.rs
+++ b/nac3core/src/codegen/test.rs
@ -15,13 +15,13 @@ use nac3parser::{
 };
 use parking_lot::RwLock;
 use super::{
    concrete_type::ConcreteTypeStore,
    types::{ListType, NDArrayType, ProxyType, RangeType},
    CodeGenContext, CodeGenLLVMOptions, CodeGenTargetMachineOptions, CodeGenTask, CodeGenerator,
    DefaultCodeGenerator, WithCall, WorkerRegistry,
 };
 use crate::{
    codegen::{
        classes::{ListType, NDArrayType, ProxyType, RangeType},
        concrete_type::ConcreteTypeStore,
        CodeGenContext, CodeGenLLVMOptions, CodeGenTargetMachineOptions, CodeGenTask,
        CodeGenerator, DefaultCodeGenerator, WithCall, WorkerRegistry,
    },
    symbol_resolver::{SymbolResolver, ValueEnum},
    toplevel::{
        composer::{ComposerConfig, TopLevelComposer},
@ -452,7 +452,7 @@ fn test_classes_list_type_new() {
    let llvm_usize = generator.get_size_type(&ctx);
    let llvm_list = ListType::new(&generator, &ctx, llvm_i32.into());
-    assert!(ListType::is_representable(llvm_list.as_base_type(), llvm_usize).is_ok());
+    assert!(ListType::is_type(llvm_list.as_base_type(), llvm_usize).is_ok());
 }
 #[test]
@ -460,7 +460,7 @@ fn test_classes_range_type_new() {
    let ctx = inkwell::context::Context::create();
    let llvm_range = RangeType::new(&ctx);
-    assert!(RangeType::is_representable(llvm_range.as_base_type()).is_ok());
+    assert!(RangeType::is_type(llvm_range.as_base_type()).is_ok());
 }
 #[test]
@ -472,5 +472,5 @@ fn test_classes_ndarray_type_new() {
    let llvm_usize = generator.get_size_type(&ctx);
    let llvm_ndarray = NDArrayType::new(&generator, &ctx, llvm_i32.into());
-    assert!(NDArrayType::is_representable(llvm_ndarray.as_base_type(), llvm_usize).is_ok());
+    assert!(NDArrayType::is_type(llvm_ndarray.as_base_type(), llvm_usize).is_ok());
 }
--- a/nac3core/src/codegen/types/list.rs
+++ b/nac3core/src/codegen/types/list.rs
@ -1,192 +0,0 @@
 use inkwell::{
    context::Context,
    types::{AnyTypeEnum, BasicType, BasicTypeEnum, IntType, PointerType},
    values::IntValue,
    AddressSpace,
 };
 use super::ProxyType;
 use crate::codegen::{
    values::{ArraySliceValue, ListValue, ProxyValue},
    CodeGenContext, CodeGenerator,
 };
 /// Proxy type for a `list` type in LLVM.
 #[derive(Debug, PartialEq, Eq, Clone, Copy)]
 pub struct ListType<'ctx> {
    ty: PointerType<'ctx>,
    llvm_usize: IntType<'ctx>,
 }
 impl<'ctx> ListType<'ctx> {
    /// Checks whether `llvm_ty` represents a `list` type, returning [Err] if it does not.
    pub fn is_representable(
        llvm_ty: PointerType<'ctx>,
        llvm_usize: IntType<'ctx>,
    ) -> Result<(), String> {
        let llvm_list_ty = llvm_ty.get_element_type();
        let AnyTypeEnum::StructType(llvm_list_ty) = llvm_list_ty else {
            return Err(format!("Expected struct type for `list` type, got {llvm_list_ty}"));
        };
        if llvm_list_ty.count_fields() != 2 {
            return Err(format!(
                "Expected 2 fields in `list`, got {}",
                llvm_list_ty.count_fields()
            ));
        }
        let list_size_ty = llvm_list_ty.get_field_type_at_index(0).unwrap();
        let Ok(_) = PointerType::try_from(list_size_ty) else {
            return Err(format!("Expected pointer type for `list.0`, got {list_size_ty}"));
        };
        let list_data_ty = llvm_list_ty.get_field_type_at_index(1).unwrap();
        let Ok(list_data_ty) = IntType::try_from(list_data_ty) else {
            return Err(format!("Expected int type for `list.1`, got {list_data_ty}"));
        };
        if list_data_ty.get_bit_width() != llvm_usize.get_bit_width() {
            return Err(format!(
                "Expected {}-bit int type for `list.1`, got {}-bit int",
                llvm_usize.get_bit_width(),
                list_data_ty.get_bit_width()
            ));
        }
        Ok(())
    }
    /// Creates an LLVM type corresponding to the expected structure of a `List`.
    #[must_use]
    fn llvm_type(
        ctx: &'ctx Context,
        element_type: BasicTypeEnum<'ctx>,
        llvm_usize: IntType<'ctx>,
    ) -> PointerType<'ctx> {
        // struct List { data: T*, size: size_t }
        let field_tys = [element_type.ptr_type(AddressSpace::default()).into(), llvm_usize.into()];
        ctx.struct_type(&field_tys, false).ptr_type(AddressSpace::default())
    }
    /// Creates an instance of [`ListType`].
    #[must_use]
    pub fn new<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        element_type: BasicTypeEnum<'ctx>,
    ) -> Self {
        let llvm_usize = generator.get_size_type(ctx);
        let llvm_list = Self::llvm_type(ctx, element_type, llvm_usize);
        ListType::from_type(llvm_list, llvm_usize)
    }
    /// Creates an [`ListType`] from a [`PointerType`].
    #[must_use]
    pub fn from_type(ptr_ty: PointerType<'ctx>, llvm_usize: IntType<'ctx>) -> Self {
        debug_assert!(Self::is_representable(ptr_ty, llvm_usize).is_ok());
        ListType { ty: ptr_ty, llvm_usize }
    }
    /// Returns the type of the `size` field of this `list` type.
    #[must_use]
    pub fn size_type(&self) -> IntType<'ctx> {
        self.as_base_type()
            .get_element_type()
            .into_struct_type()
            .get_field_type_at_index(1)
            .map(BasicTypeEnum::into_int_type)
            .unwrap()
    }
    /// Returns the element type of this `list` type.
    #[must_use]
    pub fn element_type(&self) -> AnyTypeEnum<'ctx> {
        self.as_base_type()
            .get_element_type()
            .into_struct_type()
            .get_field_type_at_index(0)
            .map(BasicTypeEnum::into_pointer_type)
            .map(PointerType::get_element_type)
            .unwrap()
    }
 }
 impl<'ctx> ProxyType<'ctx> for ListType<'ctx> {
    type Base = PointerType<'ctx>;
    type Value = ListValue<'ctx>;
    fn is_type<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        llvm_ty: impl BasicType<'ctx>,
    ) -> Result<(), String> {
        if let BasicTypeEnum::PointerType(ty) = llvm_ty.as_basic_type_enum() {
            <Self as ProxyType<'ctx>>::is_representable(generator, ctx, ty)
        } else {
            Err(format!("Expected pointer type, got {llvm_ty:?}"))
        }
    }
    fn is_representable<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        llvm_ty: Self::Base,
    ) -> Result<(), String> {
        Self::is_representable(llvm_ty, generator.get_size_type(ctx))
    }
    fn new_value<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        name: Option<&'ctx str>,
    ) -> Self::Value {
        self.map_value(
            generator
                .gen_var_alloc(
                    ctx,
                    self.as_base_type().get_element_type().into_struct_type().into(),
                    name,
                )
                .unwrap(),
            name,
        )
    }
    fn new_array_value<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        size: IntValue<'ctx>,
        name: Option<&'ctx str>,
    ) -> ArraySliceValue<'ctx> {
        generator
            .gen_array_var_alloc(
                ctx,
                self.as_base_type().get_element_type().into_struct_type().into(),
                size,
                name,
            )
            .unwrap()
    }
    fn map_value(
        &self,
        value: <Self::Value as ProxyValue<'ctx>>::Base,
        name: Option<&'ctx str>,
    ) -> Self::Value {
        Self::Value::from_pointer_value(value, self.llvm_usize, name)
    }
    fn as_base_type(&self) -> Self::Base {
        self.ty
    }
 }
 impl<'ctx> From<ListType<'ctx>> for PointerType<'ctx> {
    fn from(value: ListType<'ctx>) -> Self {
        value.as_base_type()
    }
 }
--- a/nac3core/src/codegen/types/mod.rs
+++ b/nac3core/src/codegen/types/mod.rs
@ -1,64 +0,0 @@
 use inkwell::{context::Context, types::BasicType, values::IntValue};
 use super::{
    values::{ArraySliceValue, ProxyValue},
    {CodeGenContext, CodeGenerator},
 };
 pub use list::*;
 pub use ndarray::*;
 pub use range::*;
 mod list;
 mod ndarray;
 mod range;
 pub mod structure;
 /// A LLVM type that is used to represent a corresponding type in NAC3.
 pub trait ProxyType<'ctx>: Into<Self::Base> {
    /// The LLVM type of which values of this type possess. This is usually a
    /// [LLVM pointer type][PointerType] for any non-primitive types.
    type Base: BasicType<'ctx>;
    /// The type of values represented by this type.
    type Value: ProxyValue<'ctx, Type = Self>;
    fn is_type<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        llvm_ty: impl BasicType<'ctx>,
    ) -> Result<(), String>;
    /// Checks whether `llvm_ty` can be represented by this [`ProxyType`].
    fn is_representable<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        llvm_ty: Self::Base,
    ) -> Result<(), String>;
    /// Creates a new value of this type.
    fn new_value<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        name: Option<&'ctx str>,
    ) -> Self::Value;
    /// Creates a new array value of this type.
    fn new_array_value<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        size: IntValue<'ctx>,
        name: Option<&'ctx str>,
    ) -> ArraySliceValue<'ctx>;
    /// Converts an existing value into a [`ProxyValue`] of this type.
    fn map_value(
        &self,
        value: <Self::Value as ProxyValue<'ctx>>::Base,
        name: Option<&'ctx str>,
    ) -> Self::Value;
    /// Returns the [base type][Self::Base] of this proxy.
    fn as_base_type(&self) -> Self::Base;
 }
--- a/nac3core/src/codegen/types/ndarray.rs
+++ b/nac3core/src/codegen/types/ndarray.rs
@ -1,258 +0,0 @@
 use inkwell::{
    context::Context,
    types::{AnyTypeEnum, BasicType, BasicTypeEnum, IntType, PointerType},
    values::{IntValue, PointerValue},
    AddressSpace,
 };
 use itertools::Itertools;
 use nac3core_derive::StructFields;
 use super::{
    structure::{StructField, StructFields},
    ProxyType,
 };
 use crate::codegen::{
    values::{ArraySliceValue, NDArrayValue, ProxyValue},
    {CodeGenContext, CodeGenerator},
 };
 /// Proxy type for a `ndarray` type in LLVM.
 #[derive(Debug, PartialEq, Eq, Clone, Copy)]
 pub struct NDArrayType<'ctx> {
    ty: PointerType<'ctx>,
    dtype: BasicTypeEnum<'ctx>,
    llvm_usize: IntType<'ctx>,
 }
 #[derive(PartialEq, Eq, Clone, Copy, StructFields)]
 pub struct NDArrayStructFields<'ctx> {
    #[value_type(usize)]
    pub ndims: StructField<'ctx, IntValue<'ctx>>,
    #[value_type(usize.ptr_type(AddressSpace::default()))]
    pub shape: StructField<'ctx, PointerValue<'ctx>>,
    #[value_type(i8_type().ptr_type(AddressSpace::default()))]
    pub data: StructField<'ctx, PointerValue<'ctx>>,
 }
 impl<'ctx> NDArrayType<'ctx> {
    /// Checks whether `llvm_ty` represents a `ndarray` type, returning [Err] if it does not.
    pub fn is_representable(
        llvm_ty: PointerType<'ctx>,
        llvm_usize: IntType<'ctx>,
    ) -> Result<(), String> {
        let llvm_ndarray_ty = llvm_ty.get_element_type();
        let AnyTypeEnum::StructType(llvm_ndarray_ty) = llvm_ndarray_ty else {
            return Err(format!("Expected struct type for `NDArray` type, got {llvm_ndarray_ty}"));
        };
        if llvm_ndarray_ty.count_fields() != 3 {
            return Err(format!(
                "Expected 3 fields in `NDArray`, got {}",
                llvm_ndarray_ty.count_fields()
            ));
        }
        let ndarray_ndims_ty = llvm_ndarray_ty.get_field_type_at_index(0).unwrap();
        let Ok(ndarray_ndims_ty) = IntType::try_from(ndarray_ndims_ty) else {
            return Err(format!("Expected int type for `ndarray.0`, got {ndarray_ndims_ty}"));
        };
        if ndarray_ndims_ty.get_bit_width() != llvm_usize.get_bit_width() {
            return Err(format!(
                "Expected {}-bit int type for `ndarray.0`, got {}-bit int",
                llvm_usize.get_bit_width(),
                ndarray_ndims_ty.get_bit_width()
            ));
        }
        let ndarray_dims_ty = llvm_ndarray_ty.get_field_type_at_index(1).unwrap();
        let Ok(ndarray_pdims) = PointerType::try_from(ndarray_dims_ty) else {
            return Err(format!("Expected pointer type for `ndarray.1`, got {ndarray_dims_ty}"));
        };
        let ndarray_dims = ndarray_pdims.get_element_type();
        let Ok(ndarray_dims) = IntType::try_from(ndarray_dims) else {
            return Err(format!(
                "Expected pointer-to-int type for `ndarray.1`, got pointer-to-{ndarray_dims}"
            ));
        };
        if ndarray_dims.get_bit_width() != llvm_usize.get_bit_width() {
            return Err(format!(
                "Expected pointer-to-{}-bit int type for `ndarray.1`, got pointer-to-{}-bit int",
                llvm_usize.get_bit_width(),
                ndarray_dims.get_bit_width()
            ));
        }
        let ndarray_data_ty = llvm_ndarray_ty.get_field_type_at_index(2).unwrap();
        let Ok(ndarray_pdata) = PointerType::try_from(ndarray_data_ty) else {
            return Err(format!("Expected pointer type for `ndarray.2`, got {ndarray_data_ty}"));
        };
        let ndarray_data = ndarray_pdata.get_element_type();
        let Ok(ndarray_data) = IntType::try_from(ndarray_data) else {
            return Err(format!(
                "Expected pointer-to-int type for `ndarray.2`, got pointer-to-{ndarray_data}"
            ));
        };
        if ndarray_data.get_bit_width() != 8 {
            return Err(format!(
                "Expected pointer-to-8-bit int type for `ndarray.1`, got pointer-to-{}-bit int",
                ndarray_data.get_bit_width()
            ));
        }
        Ok(())
    }
    // TODO: Move this into e.g. StructProxyType
    #[must_use]
    fn fields(ctx: &'ctx Context, llvm_usize: IntType<'ctx>) -> NDArrayStructFields<'ctx> {
        NDArrayStructFields::new(ctx, llvm_usize)
    }
    // TODO: Move this into e.g. StructProxyType
    #[must_use]
    pub fn get_fields(
        &self,
        ctx: &'ctx Context,
        llvm_usize: IntType<'ctx>,
    ) -> NDArrayStructFields<'ctx> {
        Self::fields(ctx, llvm_usize)
    }
    /// Creates an LLVM type corresponding to the expected structure of an `NDArray`.
    #[must_use]
    fn llvm_type(ctx: &'ctx Context, llvm_usize: IntType<'ctx>) -> PointerType<'ctx> {
        // struct NDArray { num_dims: size_t, dims: size_t*, data: i8* }
        //
        // * data    : Pointer to an array containing the array data
        // * itemsize: The size of each NDArray elements in bytes
        // * ndims   : Number of dimensions in the array
        // * shape   : Pointer to an array containing the shape of the NDArray
        // * strides : Pointer to an array indicating the number of bytes between each element at a dimension
        let field_tys =
            Self::fields(ctx, llvm_usize).into_iter().map(|field| field.1).collect_vec();
        ctx.struct_type(&field_tys, false).ptr_type(AddressSpace::default())
    }
    /// Creates an instance of [`NDArrayType`].
    #[must_use]
    pub fn new<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        dtype: BasicTypeEnum<'ctx>,
    ) -> Self {
        let llvm_usize = generator.get_size_type(ctx);
        let llvm_ndarray = Self::llvm_type(ctx, llvm_usize);
        NDArrayType { ty: llvm_ndarray, dtype, llvm_usize }
    }
    /// Creates an [`NDArrayType`] from a [`PointerType`] representing an `NDArray`.
    #[must_use]
    pub fn from_type(
        ptr_ty: PointerType<'ctx>,
        dtype: BasicTypeEnum<'ctx>,
        llvm_usize: IntType<'ctx>,
    ) -> Self {
        debug_assert!(Self::is_representable(ptr_ty, llvm_usize).is_ok());
        NDArrayType { ty: ptr_ty, dtype, llvm_usize }
    }
    /// Returns the type of the `size` field of this `ndarray` type.
    #[must_use]
    pub fn size_type(&self) -> IntType<'ctx> {
        self.as_base_type()
            .get_element_type()
            .into_struct_type()
            .get_field_type_at_index(0)
            .map(BasicTypeEnum::into_int_type)
            .unwrap()
    }
    /// Returns the element type of this `ndarray` type.
    #[must_use]
    pub fn element_type(&self) -> BasicTypeEnum<'ctx> {
        self.dtype
    }
 }
 impl<'ctx> ProxyType<'ctx> for NDArrayType<'ctx> {
    type Base = PointerType<'ctx>;
    type Value = NDArrayValue<'ctx>;
    fn is_type<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        llvm_ty: impl BasicType<'ctx>,
    ) -> Result<(), String> {
        if let BasicTypeEnum::PointerType(ty) = llvm_ty.as_basic_type_enum() {
            <Self as ProxyType<'ctx>>::is_representable(generator, ctx, ty)
        } else {
            Err(format!("Expected pointer type, got {llvm_ty:?}"))
        }
    }
    fn is_representable<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        llvm_ty: Self::Base,
    ) -> Result<(), String> {
        Self::is_representable(llvm_ty, generator.get_size_type(ctx))
    }
    fn new_value<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        name: Option<&'ctx str>,
    ) -> Self::Value {
        self.map_value(
            generator
                .gen_var_alloc(
                    ctx,
                    self.as_base_type().get_element_type().into_struct_type().into(),
                    name,
                )
                .unwrap(),
            name,
        )
    }
    fn new_array_value<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        size: IntValue<'ctx>,
        name: Option<&'ctx str>,
    ) -> ArraySliceValue<'ctx> {
        generator
            .gen_array_var_alloc(
                ctx,
                self.as_base_type().get_element_type().into_struct_type().into(),
                size,
                name,
            )
            .unwrap()
    }
    fn map_value(
        &self,
        value: <Self::Value as ProxyValue<'ctx>>::Base,
        name: Option<&'ctx str>,
    ) -> Self::Value {
        debug_assert_eq!(value.get_type(), self.as_base_type());
        NDArrayValue::from_pointer_value(value, self.dtype, self.llvm_usize, name)
    }
    fn as_base_type(&self) -> Self::Base {
        self.ty
    }
 }
 impl<'ctx> From<NDArrayType<'ctx>> for PointerType<'ctx> {
    fn from(value: NDArrayType<'ctx>) -> Self {
        value.as_base_type()
    }
 }
--- a/nac3core/src/codegen/types/range.rs
+++ b/nac3core/src/codegen/types/range.rs
@ -1,159 +0,0 @@
 use inkwell::{
    context::Context,
    types::{AnyTypeEnum, BasicType, BasicTypeEnum, IntType, PointerType},
    values::IntValue,
    AddressSpace,
 };
 use super::ProxyType;
 use crate::codegen::{
    values::{ArraySliceValue, ProxyValue, RangeValue},
    {CodeGenContext, CodeGenerator},
 };
 /// Proxy type for a `range` type in LLVM.
 #[derive(Debug, PartialEq, Eq, Clone, Copy)]
 pub struct RangeType<'ctx> {
    ty: PointerType<'ctx>,
 }
 impl<'ctx> RangeType<'ctx> {
    /// Checks whether `llvm_ty` represents a `range` type, returning [Err] if it does not.
    pub fn is_representable(llvm_ty: PointerType<'ctx>) -> Result<(), String> {
        let llvm_range_ty = llvm_ty.get_element_type();
        let AnyTypeEnum::ArrayType(llvm_range_ty) = llvm_range_ty else {
            return Err(format!("Expected array type for `range` type, got {llvm_range_ty}"));
        };
        if llvm_range_ty.len() != 3 {
            return Err(format!(
                "Expected 3 elements for `range` type, got {}",
                llvm_range_ty.len()
            ));
        }
        let llvm_range_elem_ty = llvm_range_ty.get_element_type();
        let Ok(llvm_range_elem_ty) = IntType::try_from(llvm_range_elem_ty) else {
            return Err(format!(
                "Expected int type for `range` element type, got {llvm_range_elem_ty}"
            ));
        };
        if llvm_range_elem_ty.get_bit_width() != 32 {
            return Err(format!(
                "Expected 32-bit int type for `range` element type, got {}",
                llvm_range_elem_ty.get_bit_width()
            ));
        }
        Ok(())
    }
    /// Creates an LLVM type corresponding to the expected structure of a `Range`.
    #[must_use]
    fn llvm_type(ctx: &'ctx Context) -> PointerType<'ctx> {
        // typedef int32_t Range[3];
        let llvm_i32 = ctx.i32_type();
        llvm_i32.array_type(3).ptr_type(AddressSpace::default())
    }
    /// Creates an instance of [`RangeType`].
    #[must_use]
    pub fn new(ctx: &'ctx Context) -> Self {
        let llvm_range = Self::llvm_type(ctx);
        RangeType::from_type(llvm_range)
    }
    /// Creates an [`RangeType`] from a [`PointerType`].
    #[must_use]
    pub fn from_type(ptr_ty: PointerType<'ctx>) -> Self {
        debug_assert!(Self::is_representable(ptr_ty).is_ok());
        RangeType { ty: ptr_ty }
    }
    /// Returns the type of all fields of this `range` type.
    #[must_use]
    pub fn value_type(&self) -> IntType<'ctx> {
        self.as_base_type().get_element_type().into_array_type().get_element_type().into_int_type()
    }
 }
 impl<'ctx> ProxyType<'ctx> for RangeType<'ctx> {
    type Base = PointerType<'ctx>;
    type Value = RangeValue<'ctx>;
    fn is_type<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        llvm_ty: impl BasicType<'ctx>,
    ) -> Result<(), String> {
        if let BasicTypeEnum::PointerType(ty) = llvm_ty.as_basic_type_enum() {
            <Self as ProxyType<'ctx>>::is_representable(generator, ctx, ty)
        } else {
            Err(format!("Expected pointer type, got {llvm_ty:?}"))
        }
    }
    fn is_representable<G: CodeGenerator + ?Sized>(
        _: &G,
        _: &'ctx Context,
        llvm_ty: Self::Base,
    ) -> Result<(), String> {
        Self::is_representable(llvm_ty)
    }
    fn new_value<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        name: Option<&'ctx str>,
    ) -> Self::Value {
        self.map_value(
            generator
                .gen_var_alloc(
                    ctx,
                    self.as_base_type().get_element_type().into_struct_type().into(),
                    name,
                )
                .unwrap(),
            name,
        )
    }
    fn new_array_value<G: CodeGenerator + ?Sized>(
        &self,
        generator: &mut G,
        ctx: &mut CodeGenContext<'ctx, '_>,
        size: IntValue<'ctx>,
        name: Option<&'ctx str>,
    ) -> ArraySliceValue<'ctx> {
        generator
            .gen_array_var_alloc(
                ctx,
                self.as_base_type().get_element_type().into_struct_type().into(),
                size,
                name,
            )
            .unwrap()
    }
    fn map_value(
        &self,
        value: <Self::Value as ProxyValue<'ctx>>::Base,
        name: Option<&'ctx str>,
    ) -> Self::Value {
        debug_assert_eq!(value.get_type(), self.as_base_type());
        RangeValue::from_pointer_value(value, name)
    }
    fn as_base_type(&self) -> Self::Base {
        self.ty
    }
 }
 impl<'ctx> From<RangeType<'ctx>> for PointerType<'ctx> {
    fn from(value: RangeType<'ctx>) -> Self {
        value.as_base_type()
    }
 }
--- a/nac3core/src/codegen/types/structure.rs
+++ b/nac3core/src/codegen/types/structure.rs
@ -1,203 +0,0 @@
 use std::marker::PhantomData;
 use inkwell::{
    context::AsContextRef,
    types::{BasicTypeEnum, IntType},
    values::{BasicValue, BasicValueEnum, IntValue, PointerValue, StructValue},
 };
 use crate::codegen::CodeGenContext;
 /// Trait indicating that the structure is a field-wise representation of an LLVM structure.
 ///
 /// # Usage
 ///
 /// For example, for a simple C-slice LLVM structure:
 ///
 /// ```ignore
 /// struct CSliceFields<'ctx> {
 ///     ptr: StructField<'ctx, PointerValue<'ctx>>,
 ///     len: StructField<'ctx, IntValue<'ctx>>
 /// }
 /// ```
 pub trait StructFields<'ctx>: Eq + Copy {
    /// Creates an instance of [`StructFields`] using the given `ctx` and `size_t` types.
    fn new(ctx: impl AsContextRef<'ctx>, llvm_usize: IntType<'ctx>) -> Self;
    /// Returns a [`Vec`] that contains the fields of the structure in the order as they appear in
    /// the type definition.
    #[must_use]
    fn to_vec(&self) -> Vec<(&'static str, BasicTypeEnum<'ctx>)>;
    /// Returns a [`Iterator`] that contains the fields of the structure in the order as they appear
    /// in the type definition.
    #[must_use]
    fn iter(&self) -> impl Iterator<Item = (&'static str, BasicTypeEnum<'ctx>)> {
        self.to_vec().into_iter()
    }
    /// Returns a [`Vec`] that contains the fields of the structure in the order as they appear in
    /// the type definition.
    #[must_use]
    fn into_vec(self) -> Vec<(&'static str, BasicTypeEnum<'ctx>)>
    where
        Self: Sized,
    {
        self.to_vec()
    }
    /// Returns a [`Iterator`] that contains the fields of the structure in the order as they appear
    /// in the type definition.
    #[must_use]
    fn into_iter(self) -> impl Iterator<Item = (&'static str, BasicTypeEnum<'ctx>)>
    where
        Self: Sized,
    {
        self.into_vec().into_iter()
    }
 }
 /// A single field of an LLVM structure.
 #[derive(Debug, PartialEq, Eq, Clone, Copy)]
 pub struct StructField<'ctx, Value>
 where
    Value: BasicValue<'ctx> + TryFrom<BasicValueEnum<'ctx>, Error = ()>,
 {
    /// The index of this field within the structure.
    index: u32,
    /// The name of this field.
    name: &'static str,
    /// The type of this field.
    ty: BasicTypeEnum<'ctx>,
    /// Instance of [`PhantomData`] containing [`Value`], used to implement automatic downcasts.
    _value_ty: PhantomData<Value>,
 }
 impl<'ctx, Value> StructField<'ctx, Value>
 where
    Value: BasicValue<'ctx> + TryFrom<BasicValueEnum<'ctx>, Error = ()>,
 {
    /// Creates an instance of [`StructField`].
    ///
    /// * `idx_counter` - The instance of [`FieldIndexCounter`] used to track the current field
    ///   index.
    /// * `name` - Name of the field.
    /// * `ty` - The type of this field.
    pub fn create(
        idx_counter: &mut FieldIndexCounter,
        name: &'static str,
        ty: impl Into<BasicTypeEnum<'ctx>>,
    ) -> Self {
        StructField { index: idx_counter.increment(), name, ty: ty.into(), _value_ty: PhantomData }
    }
    /// Creates an instance of [`StructField`] with a given index.
    ///
    /// * `index` - The index of this field within its enclosing structure.
    /// * `name` - Name of the field.
    /// * `ty` - The type of this field.
    pub fn create_at(index: u32, name: &'static str, ty: impl Into<BasicTypeEnum<'ctx>>) -> Self {
        StructField { index, name, ty: ty.into(), _value_ty: PhantomData }
    }
    /// Creates a pointer to this field in an arbitrary structure by performing a `getelementptr i32
    /// {idx...}, i32 {self.index}`.
    pub fn ptr_by_array_gep(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        pobj: PointerValue<'ctx>,
        idx: &[IntValue<'ctx>],
    ) -> PointerValue<'ctx> {
        unsafe {
            ctx.builder.build_in_bounds_gep(
                pobj,
                &[idx, &[ctx.ctx.i32_type().const_int(u64::from(self.index), false)]].concat(),
                "",
            )
        }
        .unwrap()
    }
    /// Creates a pointer to this field in an arbitrary structure by performing the equivalent of
    /// `getelementptr i32 0, i32 {self.index}`.
    pub fn ptr_by_gep(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        pobj: PointerValue<'ctx>,
        obj_name: Option<&'ctx str>,
    ) -> PointerValue<'ctx> {
        ctx.builder
            .build_struct_gep(
                pobj,
                self.index,
                &obj_name.map(|name| format!("{name}.{}.addr", self.name)).unwrap_or_default(),
            )
            .unwrap()
    }
    /// Gets the value of this field for a given `obj`.
    #[must_use]
    pub fn get_from_value(&self, obj: StructValue<'ctx>) -> Value {
        obj.get_field_at_index(self.index).and_then(|value| Value::try_from(value).ok()).unwrap()
    }
    /// Sets the value of this field for a given `obj`.
    pub fn set_from_value(&self, obj: StructValue<'ctx>, value: Value) {
        obj.set_field_at_index(self.index, value);
    }
    /// Gets the value of this field for a pointer-to-structure.
    pub fn get(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        pobj: PointerValue<'ctx>,
        obj_name: Option<&'ctx str>,
    ) -> Value {
        ctx.builder
            .build_load(
                self.ptr_by_gep(ctx, pobj, obj_name),
                &obj_name.map(|name| format!("{name}.{}", self.name)).unwrap_or_default(),
            )
            .map_err(|_| ())
            .and_then(|value| Value::try_from(value))
            .unwrap()
    }
    /// Sets the value of this field for a pointer-to-structure.
    pub fn set(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        pobj: PointerValue<'ctx>,
        value: Value,
        obj_name: Option<&'ctx str>,
    ) {
        ctx.builder.build_store(self.ptr_by_gep(ctx, pobj, obj_name), value).unwrap();
    }
 }
 impl<'ctx, Value> From<StructField<'ctx, Value>> for (&'static str, BasicTypeEnum<'ctx>)
 where
    Value: BasicValue<'ctx> + TryFrom<BasicValueEnum<'ctx>, Error = ()>,
 {
    fn from(value: StructField<'ctx, Value>) -> Self {
        (value.name, value.ty)
    }
 }
 /// A counter that tracks the next index of a field using a monotonically increasing counter.
 #[derive(Default, Debug, PartialEq, Eq, Clone, Copy)]
 pub struct FieldIndexCounter(u32);
 impl FieldIndexCounter {
    /// Increments the number stored by this counter, returning the previous value.
    ///
    /// Functionally equivalent to `i++` in C-based languages.
    pub fn increment(&mut self) -> u32 {
        let v = self.0;
        self.0 += 1;
        v
    }
 }
--- a/nac3core/src/codegen/values/array.rs
+++ b/nac3core/src/codegen/values/array.rs
@ -1,426 +0,0 @@
 use inkwell::{
    types::AnyTypeEnum,
    values::{BasicValueEnum, IntValue, PointerValue},
    IntPredicate,
 };
 use crate::codegen::{CodeGenContext, CodeGenerator};
 /// An LLVM value that is array-like, i.e. it contains a contiguous, sequenced collection of
 /// elements.
 pub trait ArrayLikeValue<'ctx> {
    /// Returns the element type of this array-like value.
    fn element_type<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> AnyTypeEnum<'ctx>;
    /// Returns the base pointer to the array.
    fn base_ptr<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> PointerValue<'ctx>;
    /// Returns the size of this array-like value.
    fn size<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> IntValue<'ctx>;
    /// Returns a [`ArraySliceValue`] representing this value.
    fn as_slice_value<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> ArraySliceValue<'ctx> {
        ArraySliceValue::from_ptr_val(
            self.base_ptr(ctx, generator),
            self.size(ctx, generator),
            None,
        )
    }
 }
 /// An array-like value that can be indexed by memory offset.
 pub trait ArrayLikeIndexer<'ctx, Index = IntValue<'ctx>>: ArrayLikeValue<'ctx> {
    /// # Safety
    ///
    /// This function should be called with a valid index.
    unsafe fn ptr_offset_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        name: Option<&str>,
    ) -> PointerValue<'ctx>;
    /// Returns the pointer to the data at the `idx`-th index.
    fn ptr_offset<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        name: Option<&str>,
    ) -> PointerValue<'ctx>;
 }
 /// An array-like value that can have its array elements accessed as a [`BasicValueEnum`].
 pub trait UntypedArrayLikeAccessor<'ctx, Index = IntValue<'ctx>>:
    ArrayLikeIndexer<'ctx, Index>
 {
    /// # Safety
    ///
    /// This function should be called with a valid index.
    unsafe fn get_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        name: Option<&str>,
    ) -> BasicValueEnum<'ctx> {
        let ptr = unsafe { self.ptr_offset_unchecked(ctx, generator, idx, name) };
        ctx.builder.build_load(ptr, name.unwrap_or_default()).unwrap()
    }
    /// Returns the data at the `idx`-th index.
    fn get<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        name: Option<&str>,
    ) -> BasicValueEnum<'ctx> {
        let ptr = self.ptr_offset(ctx, generator, idx, name);
        ctx.builder.build_load(ptr, name.unwrap_or_default()).unwrap()
    }
 }
 /// An array-like value that can have its array elements mutated as a [`BasicValueEnum`].
 pub trait UntypedArrayLikeMutator<'ctx, Index = IntValue<'ctx>>:
    ArrayLikeIndexer<'ctx, Index>
 {
    /// # Safety
    ///
    /// This function should be called with a valid index.
    unsafe fn set_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        value: BasicValueEnum<'ctx>,
    ) {
        let ptr = unsafe { self.ptr_offset_unchecked(ctx, generator, idx, None) };
        ctx.builder.build_store(ptr, value).unwrap();
    }
    /// Sets the data at the `idx`-th index.
    fn set<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        value: BasicValueEnum<'ctx>,
    ) {
        let ptr = self.ptr_offset(ctx, generator, idx, None);
        ctx.builder.build_store(ptr, value).unwrap();
    }
 }
 /// An array-like value that can have its array elements accessed as an arbitrary type `T`.
 pub trait TypedArrayLikeAccessor<'ctx, T, Index = IntValue<'ctx>>:
    UntypedArrayLikeAccessor<'ctx, Index>
 {
    /// Casts an element from [`BasicValueEnum`] into `T`.
    fn downcast_to_type(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        value: BasicValueEnum<'ctx>,
    ) -> T;
    /// # Safety
    ///
    /// This function should be called with a valid index.
    unsafe fn get_typed_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        name: Option<&str>,
    ) -> T {
        let value = unsafe { self.get_unchecked(ctx, generator, idx, name) };
        self.downcast_to_type(ctx, value)
    }
    /// Returns the data at the `idx`-th index.
    fn get_typed<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        name: Option<&str>,
    ) -> T {
        let value = self.get(ctx, generator, idx, name);
        self.downcast_to_type(ctx, value)
    }
 }
 /// An array-like value that can have its array elements mutated as an arbitrary type `T`.
 pub trait TypedArrayLikeMutator<'ctx, T, Index = IntValue<'ctx>>:
    UntypedArrayLikeMutator<'ctx, Index>
 {
    /// Casts an element from T into [`BasicValueEnum`].
    fn upcast_from_type(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        value: T,
    ) -> BasicValueEnum<'ctx>;
    /// # Safety
    ///
    /// This function should be called with a valid index.
    unsafe fn set_typed_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        value: T,
    ) {
        let value = self.upcast_from_type(ctx, value);
        unsafe { self.set_unchecked(ctx, generator, idx, value) }
    }
    /// Sets the data at the `idx`-th index.
    fn set_typed<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        value: T,
    ) {
        let value = self.upcast_from_type(ctx, value);
        self.set(ctx, generator, idx, value);
    }
 }
 /// Type alias for a function that casts a [`BasicValueEnum`] into a `T`.
 type ValueDowncastFn<'ctx, T> =
    Box<dyn Fn(&mut CodeGenContext<'ctx, '_>, BasicValueEnum<'ctx>) -> T>;
 /// Type alias for a function that casts a `T` into a [`BasicValueEnum`].
 type ValueUpcastFn<'ctx, T> = Box<dyn Fn(&mut CodeGenContext<'ctx, '_>, T) -> BasicValueEnum<'ctx>>;
 /// An adapter for constraining untyped array values as typed values.
 pub struct TypedArrayLikeAdapter<'ctx, T, Adapted: ArrayLikeValue<'ctx> = ArraySliceValue<'ctx>> {
    adapted: Adapted,
    downcast_fn: ValueDowncastFn<'ctx, T>,
    upcast_fn: ValueUpcastFn<'ctx, T>,
 }
 impl<'ctx, T, Adapted> TypedArrayLikeAdapter<'ctx, T, Adapted>
 where
    Adapted: ArrayLikeValue<'ctx>,
 {
    /// Creates a [`TypedArrayLikeAdapter`].
    ///
    /// * `adapted` - The value to be adapted.
    /// * `downcast_fn` - The function converting a [`BasicValueEnum`] into a `T`.
    /// * `upcast_fn` - The function converting a T into a [`BasicValueEnum`].
    pub fn from(
        adapted: Adapted,
        downcast_fn: ValueDowncastFn<'ctx, T>,
        upcast_fn: ValueUpcastFn<'ctx, T>,
    ) -> Self {
        TypedArrayLikeAdapter { adapted, downcast_fn, upcast_fn }
    }
 }
 impl<'ctx, T, Adapted> ArrayLikeValue<'ctx> for TypedArrayLikeAdapter<'ctx, T, Adapted>
 where
    Adapted: ArrayLikeValue<'ctx>,
 {
    fn element_type<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> AnyTypeEnum<'ctx> {
        self.adapted.element_type(ctx, generator)
    }
    fn base_ptr<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> PointerValue<'ctx> {
        self.adapted.base_ptr(ctx, generator)
    }
    fn size<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> IntValue<'ctx> {
        self.adapted.size(ctx, generator)
    }
 }
 impl<'ctx, T, Index, Adapted> ArrayLikeIndexer<'ctx, Index>
    for TypedArrayLikeAdapter<'ctx, T, Adapted>
 where
    Adapted: ArrayLikeIndexer<'ctx, Index>,
 {
    unsafe fn ptr_offset_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        unsafe { self.adapted.ptr_offset_unchecked(ctx, generator, idx, name) }
    }
    fn ptr_offset<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &Index,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        self.adapted.ptr_offset(ctx, generator, idx, name)
    }
 }
 impl<'ctx, T, Index, Adapted> UntypedArrayLikeAccessor<'ctx, Index>
    for TypedArrayLikeAdapter<'ctx, T, Adapted>
 where
    Adapted: UntypedArrayLikeAccessor<'ctx, Index>,
 {
 }
 impl<'ctx, T, Index, Adapted> UntypedArrayLikeMutator<'ctx, Index>
    for TypedArrayLikeAdapter<'ctx, T, Adapted>
 where
    Adapted: UntypedArrayLikeMutator<'ctx, Index>,
 {
 }
 impl<'ctx, T, Index, Adapted> TypedArrayLikeAccessor<'ctx, T, Index>
    for TypedArrayLikeAdapter<'ctx, T, Adapted>
 where
    Adapted: UntypedArrayLikeAccessor<'ctx, Index>,
 {
    fn downcast_to_type(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        value: BasicValueEnum<'ctx>,
    ) -> T {
        (self.downcast_fn)(ctx, value)
    }
 }
 impl<'ctx, T, Index, Adapted> TypedArrayLikeMutator<'ctx, T, Index>
    for TypedArrayLikeAdapter<'ctx, T, Adapted>
 where
    Adapted: UntypedArrayLikeMutator<'ctx, Index>,
 {
    fn upcast_from_type(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        value: T,
    ) -> BasicValueEnum<'ctx> {
        (self.upcast_fn)(ctx, value)
    }
 }
 /// An LLVM value representing an array slice, consisting of a pointer to the data and the size of
 /// the slice.
 #[derive(Copy, Clone)]
 pub struct ArraySliceValue<'ctx>(PointerValue<'ctx>, IntValue<'ctx>, Option<&'ctx str>);
 impl<'ctx> ArraySliceValue<'ctx> {
    /// Creates an [`ArraySliceValue`] from a [`PointerValue`] and its size.
    #[must_use]
    pub fn from_ptr_val(
        ptr: PointerValue<'ctx>,
        size: IntValue<'ctx>,
        name: Option<&'ctx str>,
    ) -> Self {
        ArraySliceValue(ptr, size, name)
    }
 }
 impl<'ctx> From<ArraySliceValue<'ctx>> for PointerValue<'ctx> {
    fn from(value: ArraySliceValue<'ctx>) -> Self {
        value.0
    }
 }
 impl<'ctx> ArrayLikeValue<'ctx> for ArraySliceValue<'ctx> {
    fn element_type<G: CodeGenerator + ?Sized>(
        &self,
        _: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> AnyTypeEnum<'ctx> {
        self.0.get_type().get_element_type()
    }
    fn base_ptr<G: CodeGenerator + ?Sized>(
        &self,
        _: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> PointerValue<'ctx> {
        self.0
    }
    fn size<G: CodeGenerator + ?Sized>(
        &self,
        _: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> IntValue<'ctx> {
        self.1
    }
 }
 impl<'ctx> ArrayLikeIndexer<'ctx> for ArraySliceValue<'ctx> {
    unsafe fn ptr_offset_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &IntValue<'ctx>,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        let var_name = name.map(|v| format!("{v}.addr")).unwrap_or_default();
        unsafe {
            ctx.builder
                .build_in_bounds_gep(self.base_ptr(ctx, generator), &[*idx], var_name.as_str())
                .unwrap()
        }
    }
    fn ptr_offset<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &IntValue<'ctx>,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        debug_assert_eq!(idx.get_type(), generator.get_size_type(ctx.ctx));
        let size = self.size(ctx, generator);
        let in_range = ctx.builder.build_int_compare(IntPredicate::ULT, *idx, size, "").unwrap();
        ctx.make_assert(
            generator,
            in_range,
            "0:IndexError",
            "list index out of range",
            [None, None, None],
            ctx.current_loc,
        );
        unsafe { self.ptr_offset_unchecked(ctx, generator, idx, name) }
    }
 }
 impl<'ctx> UntypedArrayLikeAccessor<'ctx> for ArraySliceValue<'ctx> {}
 impl<'ctx> UntypedArrayLikeMutator<'ctx> for ArraySliceValue<'ctx> {}
--- a/nac3core/src/codegen/values/list.rs
+++ b/nac3core/src/codegen/values/list.rs
@ -1,241 +0,0 @@
 use inkwell::{
    types::{AnyTypeEnum, BasicType, BasicTypeEnum, IntType},
    values::{BasicValueEnum, IntValue, PointerValue},
    AddressSpace, IntPredicate,
 };
 use super::{
    ArrayLikeIndexer, ArrayLikeValue, ProxyValue, UntypedArrayLikeAccessor, UntypedArrayLikeMutator,
 };
 use crate::codegen::{
    types::ListType,
    {CodeGenContext, CodeGenerator},
 };
 /// Proxy type for accessing a `list` value in LLVM.
 #[derive(Copy, Clone)]
 pub struct ListValue<'ctx> {
    value: PointerValue<'ctx>,
    llvm_usize: IntType<'ctx>,
    name: Option<&'ctx str>,
 }
 impl<'ctx> ListValue<'ctx> {
    /// Checks whether `value` is an instance of `list`, returning [Err] if `value` is not an
    /// instance.
    pub fn is_representable(
        value: PointerValue<'ctx>,
        llvm_usize: IntType<'ctx>,
    ) -> Result<(), String> {
        ListType::is_representable(value.get_type(), llvm_usize)
    }
    /// Creates an [`ListValue`] from a [`PointerValue`].
    #[must_use]
    pub fn from_pointer_value(
        ptr: PointerValue<'ctx>,
        llvm_usize: IntType<'ctx>,
        name: Option<&'ctx str>,
    ) -> Self {
        debug_assert!(Self::is_representable(ptr, llvm_usize).is_ok());
        ListValue { value: ptr, llvm_usize, name }
    }
    /// Returns the double-indirection pointer to the `data` array, as if by calling `getelementptr`
    /// on the field.
    fn pptr_to_data(&self, ctx: &CodeGenContext<'ctx, '_>) -> PointerValue<'ctx> {
        let llvm_i32 = ctx.ctx.i32_type();
        let var_name = self.name.map(|v| format!("{v}.data.addr")).unwrap_or_default();
        unsafe {
            ctx.builder
                .build_in_bounds_gep(
                    self.as_base_value(),
                    &[llvm_i32.const_zero(), llvm_i32.const_zero()],
                    var_name.as_str(),
                )
                .unwrap()
        }
    }
    /// Returns the pointer to the field storing the size of this `list`.
    fn ptr_to_size(&self, ctx: &CodeGenContext<'ctx, '_>) -> PointerValue<'ctx> {
        let llvm_i32 = ctx.ctx.i32_type();
        let var_name = self.name.map(|v| format!("{v}.size.addr")).unwrap_or_default();
        unsafe {
            ctx.builder
                .build_in_bounds_gep(
                    self.as_base_value(),
                    &[llvm_i32.const_zero(), llvm_i32.const_int(1, true)],
                    var_name.as_str(),
                )
                .unwrap()
        }
    }
    /// Stores the array of data elements `data` into this instance.
    fn store_data(&self, ctx: &CodeGenContext<'ctx, '_>, data: PointerValue<'ctx>) {
        ctx.builder.build_store(self.pptr_to_data(ctx), data).unwrap();
    }
    /// Convenience method for creating a new array storing data elements with the given element
    /// type `elem_ty` and `size`.
    ///
    /// If `size` is [None], the size stored in the field of this instance is used instead.
    pub fn create_data(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        elem_ty: BasicTypeEnum<'ctx>,
        size: Option<IntValue<'ctx>>,
    ) {
        let size = size.unwrap_or_else(|| self.load_size(ctx, None));
        let data = ctx
            .builder
            .build_select(
                ctx.builder
                    .build_int_compare(IntPredicate::NE, size, self.llvm_usize.const_zero(), "")
                    .unwrap(),
                ctx.builder.build_array_alloca(elem_ty, size, "").unwrap(),
                elem_ty.ptr_type(AddressSpace::default()).const_zero(),
                "",
            )
            .map(BasicValueEnum::into_pointer_value)
            .unwrap();
        self.store_data(ctx, data);
    }
    /// Returns the double-indirection pointer to the `data` array, as if by calling `getelementptr`
    /// on the field.
    #[must_use]
    pub fn data(&self) -> ListDataProxy<'ctx, '_> {
        ListDataProxy(self)
    }
    /// Stores the `size` of this `list` into this instance.
    pub fn store_size<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
        size: IntValue<'ctx>,
    ) {
        debug_assert_eq!(size.get_type(), generator.get_size_type(ctx.ctx));
        let psize = self.ptr_to_size(ctx);
        ctx.builder.build_store(psize, size).unwrap();
    }
    /// Returns the size of this `list` as a value.
    pub fn load_size(&self, ctx: &CodeGenContext<'ctx, '_>, name: Option<&str>) -> IntValue<'ctx> {
        let psize = self.ptr_to_size(ctx);
        let var_name = name
            .map(ToString::to_string)
            .or_else(|| self.name.map(|v| format!("{v}.size")))
            .unwrap_or_default();
        ctx.builder
            .build_load(psize, var_name.as_str())
            .map(BasicValueEnum::into_int_value)
            .unwrap()
    }
 }
 impl<'ctx> ProxyValue<'ctx> for ListValue<'ctx> {
    type Base = PointerValue<'ctx>;
    type Type = ListType<'ctx>;
    fn get_type(&self) -> Self::Type {
        ListType::from_type(self.as_base_value().get_type(), self.llvm_usize)
    }
    fn as_base_value(&self) -> Self::Base {
        self.value
    }
 }
 impl<'ctx> From<ListValue<'ctx>> for PointerValue<'ctx> {
    fn from(value: ListValue<'ctx>) -> Self {
        value.as_base_value()
    }
 }
 /// Proxy type for accessing the `data` array of an `list` instance in LLVM.
 #[derive(Copy, Clone)]
 pub struct ListDataProxy<'ctx, 'a>(&'a ListValue<'ctx>);
 impl<'ctx> ArrayLikeValue<'ctx> for ListDataProxy<'ctx, '_> {
    fn element_type<G: CodeGenerator + ?Sized>(
        &self,
        _: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> AnyTypeEnum<'ctx> {
        self.0.value.get_type().get_element_type()
    }
    fn base_ptr<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> PointerValue<'ctx> {
        let var_name = self.0.name.map(|v| format!("{v}.data")).unwrap_or_default();
        ctx.builder
            .build_load(self.0.pptr_to_data(ctx), var_name.as_str())
            .map(BasicValueEnum::into_pointer_value)
            .unwrap()
    }
    fn size<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> IntValue<'ctx> {
        self.0.load_size(ctx, None)
    }
 }
 impl<'ctx> ArrayLikeIndexer<'ctx> for ListDataProxy<'ctx, '_> {
    unsafe fn ptr_offset_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &IntValue<'ctx>,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        let var_name = name.map(|v| format!("{v}.addr")).unwrap_or_default();
        unsafe {
            ctx.builder
                .build_in_bounds_gep(self.base_ptr(ctx, generator), &[*idx], var_name.as_str())
                .unwrap()
        }
    }
    fn ptr_offset<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &IntValue<'ctx>,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        debug_assert_eq!(idx.get_type(), generator.get_size_type(ctx.ctx));
        let size = self.size(ctx, generator);
        let in_range = ctx.builder.build_int_compare(IntPredicate::ULT, *idx, size, "").unwrap();
        ctx.make_assert(
            generator,
            in_range,
            "0:IndexError",
            "list index out of range",
            [None, None, None],
            ctx.current_loc,
        );
        unsafe { self.ptr_offset_unchecked(ctx, generator, idx, name) }
    }
 }
 impl<'ctx> UntypedArrayLikeAccessor<'ctx> for ListDataProxy<'ctx, '_> {}
 impl<'ctx> UntypedArrayLikeMutator<'ctx> for ListDataProxy<'ctx, '_> {}
--- a/nac3core/src/codegen/values/mod.rs
+++ b/nac3core/src/codegen/values/mod.rs
@ -1,47 +0,0 @@
 use inkwell::{context::Context, values::BasicValue};
 use super::types::ProxyType;
 use crate::codegen::CodeGenerator;
 pub use array::*;
 pub use list::*;
 pub use ndarray::*;
 pub use range::*;
 mod array;
 mod list;
 mod ndarray;
 mod range;
 /// A LLVM type that is used to represent a non-primitive value in NAC3.
 pub trait ProxyValue<'ctx>: Into<Self::Base> {
    /// The type of LLVM values represented by this instance. This is usually the
    /// [LLVM pointer type][PointerValue].
    type Base: BasicValue<'ctx>;
    /// The type of this value.
    type Type: ProxyType<'ctx, Value = Self>;
    /// Checks whether `value` can be represented by this [`ProxyValue`].
    fn is_instance<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        value: impl BasicValue<'ctx>,
    ) -> Result<(), String> {
        Self::Type::is_type(generator, ctx, value.as_basic_value_enum().get_type())
    }
    /// Checks whether `value` can be represented by this [`ProxyValue`].
    fn is_representable<G: CodeGenerator + ?Sized>(
        generator: &G,
        ctx: &'ctx Context,
        value: Self::Base,
    ) -> Result<(), String> {
        Self::is_instance(generator, ctx, value.as_basic_value_enum())
    }
    /// Returns the [type][ProxyType] of this value.
    fn get_type(&self) -> Self::Type;
    /// Returns the [base value][Self::Base] of this proxy.
    fn as_base_value(&self) -> Self::Base;
 }
--- a/nac3core/src/codegen/values/ndarray.rs
+++ b/nac3core/src/codegen/values/ndarray.rs
@ -1,523 +0,0 @@
 use inkwell::{
    types::{AnyType, AnyTypeEnum, BasicType, BasicTypeEnum, IntType},
    values::{BasicValueEnum, IntValue, PointerValue},
    AddressSpace, IntPredicate,
 };
 use super::{
    ArrayLikeIndexer, ArrayLikeValue, ProxyValue, TypedArrayLikeAccessor, TypedArrayLikeMutator,
    UntypedArrayLikeAccessor, UntypedArrayLikeMutator,
 };
 use crate::codegen::{
    irrt::{call_ndarray_calc_size, call_ndarray_flatten_index},
    llvm_intrinsics::call_int_umin,
    stmt::gen_for_callback_incrementing,
    types::NDArrayType,
    CodeGenContext, CodeGenerator,
 };
 /// Proxy type for accessing an `NDArray` value in LLVM.
 #[derive(Copy, Clone)]
 pub struct NDArrayValue<'ctx> {
    value: PointerValue<'ctx>,
    dtype: BasicTypeEnum<'ctx>,
    llvm_usize: IntType<'ctx>,
    name: Option<&'ctx str>,
 }
 impl<'ctx> NDArrayValue<'ctx> {
    /// Checks whether `value` is an instance of `NDArray`, returning [Err] if `value` is not an
    /// instance.
    pub fn is_representable(
        value: PointerValue<'ctx>,
        llvm_usize: IntType<'ctx>,
    ) -> Result<(), String> {
        NDArrayType::is_representable(value.get_type(), llvm_usize)
    }
    /// Creates an [`NDArrayValue`] from a [`PointerValue`].
    #[must_use]
    pub fn from_pointer_value(
        ptr: PointerValue<'ctx>,
        dtype: BasicTypeEnum<'ctx>,
        llvm_usize: IntType<'ctx>,
        name: Option<&'ctx str>,
    ) -> Self {
        debug_assert!(Self::is_representable(ptr, llvm_usize).is_ok());
        NDArrayValue { value: ptr, dtype, llvm_usize, name }
    }
    /// Returns the pointer to the field storing the number of dimensions of this `NDArray`.
    fn ptr_to_ndims(&self, ctx: &CodeGenContext<'ctx, '_>) -> PointerValue<'ctx> {
        self.get_type()
            .get_fields(ctx.ctx, self.llvm_usize)
            .ndims
            .ptr_by_gep(ctx, self.value, self.name)
    }
    /// Stores the number of dimensions `ndims` into this instance.
    pub fn store_ndims<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
        ndims: IntValue<'ctx>,
    ) {
        debug_assert_eq!(ndims.get_type(), generator.get_size_type(ctx.ctx));
        let pndims = self.ptr_to_ndims(ctx);
        ctx.builder.build_store(pndims, ndims).unwrap();
    }
    /// Returns the number of dimensions of this `NDArray` as a value.
    pub fn load_ndims(&self, ctx: &CodeGenContext<'ctx, '_>) -> IntValue<'ctx> {
        let pndims = self.ptr_to_ndims(ctx);
        ctx.builder.build_load(pndims, "").map(BasicValueEnum::into_int_value).unwrap()
    }
    /// Returns the double-indirection pointer to the `shape` array, as if by calling
    /// `getelementptr` on the field.
    fn ptr_to_shape(&self, ctx: &CodeGenContext<'ctx, '_>) -> PointerValue<'ctx> {
        self.get_type()
            .get_fields(ctx.ctx, self.llvm_usize)
            .shape
            .ptr_by_gep(ctx, self.value, self.name)
    }
    /// Stores the array of dimension sizes `dims` into this instance.
    fn store_shape(&self, ctx: &CodeGenContext<'ctx, '_>, dims: PointerValue<'ctx>) {
        ctx.builder.build_store(self.ptr_to_shape(ctx), dims).unwrap();
    }
    /// Convenience method for creating a new array storing dimension sizes with the given `size`.
    pub fn create_shape(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        llvm_usize: IntType<'ctx>,
        size: IntValue<'ctx>,
    ) {
        self.store_shape(ctx, ctx.builder.build_array_alloca(llvm_usize, size, "").unwrap());
    }
    /// Returns a proxy object to the field storing the size of each dimension of this `NDArray`.
    #[must_use]
    pub fn shape(&self) -> NDArrayShapeProxy<'ctx, '_> {
        NDArrayShapeProxy(self)
    }
    /// Returns the double-indirection pointer to the `data` array, as if by calling `getelementptr`
    /// on the field.
    pub fn ptr_to_data(&self, ctx: &CodeGenContext<'ctx, '_>) -> PointerValue<'ctx> {
        self.get_type()
            .get_fields(ctx.ctx, self.llvm_usize)
            .data
            .ptr_by_gep(ctx, self.value, self.name)
    }
    /// Stores the array of data elements `data` into this instance.
    fn store_data(&self, ctx: &CodeGenContext<'ctx, '_>, data: PointerValue<'ctx>) {
        let data = ctx
            .builder
            .build_bit_cast(data, ctx.ctx.i8_type().ptr_type(AddressSpace::default()), "")
            .unwrap();
        ctx.builder.build_store(self.ptr_to_data(ctx), data).unwrap();
    }
    /// Convenience method for creating a new array storing data elements with the given element
    /// type `elem_ty` and `size`.
    pub fn create_data(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        elem_ty: BasicTypeEnum<'ctx>,
        size: IntValue<'ctx>,
    ) {
        let itemsize =
            ctx.builder.build_int_cast(elem_ty.size_of().unwrap(), size.get_type(), "").unwrap();
        let nbytes = ctx.builder.build_int_mul(size, itemsize, "").unwrap();
        // TODO: What about alignment?
        self.store_data(
            ctx,
            ctx.builder.build_array_alloca(ctx.ctx.i8_type(), nbytes, "").unwrap(),
        );
    }
    /// Returns a proxy object to the field storing the data of this `NDArray`.
    #[must_use]
    pub fn data(&self) -> NDArrayDataProxy<'ctx, '_> {
        NDArrayDataProxy(self)
    }
 }
 impl<'ctx> ProxyValue<'ctx> for NDArrayValue<'ctx> {
    type Base = PointerValue<'ctx>;
    type Type = NDArrayType<'ctx>;
    fn get_type(&self) -> Self::Type {
        NDArrayType::from_type(self.as_base_value().get_type(), self.dtype, self.llvm_usize)
    }
    fn as_base_value(&self) -> Self::Base {
        self.value
    }
 }
 impl<'ctx> From<NDArrayValue<'ctx>> for PointerValue<'ctx> {
    fn from(value: NDArrayValue<'ctx>) -> Self {
        value.as_base_value()
    }
 }
 /// Proxy type for accessing the `dims` array of an `NDArray` instance in LLVM.
 #[derive(Copy, Clone)]
 pub struct NDArrayShapeProxy<'ctx, 'a>(&'a NDArrayValue<'ctx>);
 impl<'ctx> ArrayLikeValue<'ctx> for NDArrayShapeProxy<'ctx, '_> {
    fn element_type<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> AnyTypeEnum<'ctx> {
        self.0.shape().base_ptr(ctx, generator).get_type().get_element_type()
    }
    fn base_ptr<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> PointerValue<'ctx> {
        let var_name = self.0.name.map(|v| format!("{v}.data")).unwrap_or_default();
        ctx.builder
            .build_load(self.0.ptr_to_shape(ctx), var_name.as_str())
            .map(BasicValueEnum::into_pointer_value)
            .unwrap()
    }
    fn size<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> IntValue<'ctx> {
        self.0.load_ndims(ctx)
    }
 }
 impl<'ctx> ArrayLikeIndexer<'ctx, IntValue<'ctx>> for NDArrayShapeProxy<'ctx, '_> {
    unsafe fn ptr_offset_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &IntValue<'ctx>,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        let var_name = name.map(|v| format!("{v}.addr")).unwrap_or_default();
        unsafe {
            ctx.builder
                .build_in_bounds_gep(self.base_ptr(ctx, generator), &[*idx], var_name.as_str())
                .unwrap()
        }
    }
    fn ptr_offset<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &IntValue<'ctx>,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        let size = self.size(ctx, generator);
        let in_range = ctx.builder.build_int_compare(IntPredicate::ULT, *idx, size, "").unwrap();
        ctx.make_assert(
            generator,
            in_range,
            "0:IndexError",
            "index {0} is out of bounds for axis 0 with size {1}",
            [Some(*idx), Some(self.0.load_ndims(ctx)), None],
            ctx.current_loc,
        );
        unsafe { self.ptr_offset_unchecked(ctx, generator, idx, name) }
    }
 }
 impl<'ctx> UntypedArrayLikeAccessor<'ctx, IntValue<'ctx>> for NDArrayShapeProxy<'ctx, '_> {}
 impl<'ctx> UntypedArrayLikeMutator<'ctx, IntValue<'ctx>> for NDArrayShapeProxy<'ctx, '_> {}
 impl<'ctx> TypedArrayLikeAccessor<'ctx, IntValue<'ctx>> for NDArrayShapeProxy<'ctx, '_> {
    fn downcast_to_type(
        &self,
        _: &mut CodeGenContext<'ctx, '_>,
        value: BasicValueEnum<'ctx>,
    ) -> IntValue<'ctx> {
        value.into_int_value()
    }
 }
 impl<'ctx> TypedArrayLikeMutator<'ctx, IntValue<'ctx>> for NDArrayShapeProxy<'ctx, '_> {
    fn upcast_from_type(
        &self,
        _: &mut CodeGenContext<'ctx, '_>,
        value: IntValue<'ctx>,
    ) -> BasicValueEnum<'ctx> {
        value.into()
    }
 }
 /// Proxy type for accessing the `data` array of an `NDArray` instance in LLVM.
 #[derive(Copy, Clone)]
 pub struct NDArrayDataProxy<'ctx, 'a>(&'a NDArrayValue<'ctx>);
 impl<'ctx> ArrayLikeValue<'ctx> for NDArrayDataProxy<'ctx, '_> {
    fn element_type<G: CodeGenerator + ?Sized>(
        &self,
        _: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> AnyTypeEnum<'ctx> {
        self.0.dtype.as_any_type_enum()
    }
    fn base_ptr<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        _: &G,
    ) -> PointerValue<'ctx> {
        let var_name = self.0.name.map(|v| format!("{v}.data")).unwrap_or_default();
        ctx.builder
            .build_load(self.0.ptr_to_data(ctx), var_name.as_str())
            .map(BasicValueEnum::into_pointer_value)
            .unwrap()
    }
    fn size<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &CodeGenContext<'ctx, '_>,
        generator: &G,
    ) -> IntValue<'ctx> {
        call_ndarray_calc_size(generator, ctx, &self.as_slice_value(ctx, generator), (None, None))
    }
 }
 impl<'ctx> ArrayLikeIndexer<'ctx> for NDArrayDataProxy<'ctx, '_> {
    unsafe fn ptr_offset_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &IntValue<'ctx>,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        let sizeof_elem = ctx
            .builder
            .build_int_truncate_or_bit_cast(
                self.element_type(ctx, generator).size_of().unwrap(),
                idx.get_type(),
                "",
            )
            .unwrap();
        let idx = ctx.builder.build_int_mul(*idx, sizeof_elem, "").unwrap();
        let ptr = unsafe {
            ctx.builder
                .build_in_bounds_gep(
                    self.base_ptr(ctx, generator),
                    &[idx],
                    name.unwrap_or_default(),
                )
                .unwrap()
        };
        // Current implementation is transparent - The returned pointer type is
        // already cast into the expected type, allowing for immediately
        // load/store.
        ctx.builder
            .build_pointer_cast(
                ptr,
                BasicTypeEnum::try_from(self.element_type(ctx, generator))
                    .unwrap()
                    .ptr_type(AddressSpace::default()),
                "",
            )
            .unwrap()
    }
    fn ptr_offset<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        idx: &IntValue<'ctx>,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        let data_sz = self.size(ctx, generator);
        let in_range = ctx.builder.build_int_compare(IntPredicate::ULT, *idx, data_sz, "").unwrap();
        ctx.make_assert(
            generator,
            in_range,
            "0:IndexError",
            "index {0} is out of bounds with size {1}",
            [Some(*idx), Some(self.0.load_ndims(ctx)), None],
            ctx.current_loc,
        );
        let ptr = unsafe { self.ptr_offset_unchecked(ctx, generator, idx, name) };
        // Current implementation is transparent - The returned pointer type is
        // already cast into the expected type, allowing for immediately
        // load/store.
        ctx.builder
            .build_pointer_cast(
                ptr,
                BasicTypeEnum::try_from(self.element_type(ctx, generator))
                    .unwrap()
                    .ptr_type(AddressSpace::default()),
                "",
            )
            .unwrap()
    }
 }
 impl<'ctx> UntypedArrayLikeAccessor<'ctx, IntValue<'ctx>> for NDArrayDataProxy<'ctx, '_> {}
 impl<'ctx> UntypedArrayLikeMutator<'ctx, IntValue<'ctx>> for NDArrayDataProxy<'ctx, '_> {}
 impl<'ctx, Index: UntypedArrayLikeAccessor<'ctx>> ArrayLikeIndexer<'ctx, Index>
    for NDArrayDataProxy<'ctx, '_>
 {
    unsafe fn ptr_offset_unchecked<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        indices: &Index,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        let llvm_usize = generator.get_size_type(ctx.ctx);
        let indices_elem_ty = indices
            .ptr_offset(ctx, generator, &llvm_usize.const_zero(), None)
            .get_type()
            .get_element_type();
        let Ok(indices_elem_ty) = IntType::try_from(indices_elem_ty) else {
            panic!("Expected list[int32] but got {indices_elem_ty}")
        };
        assert_eq!(
            indices_elem_ty.get_bit_width(),
            32,
            "Expected list[int32] but got list[int{}]",
            indices_elem_ty.get_bit_width()
        );
        let index = call_ndarray_flatten_index(generator, ctx, *self.0, indices);
        let sizeof_elem = ctx
            .builder
            .build_int_truncate_or_bit_cast(
                self.element_type(ctx, generator).size_of().unwrap(),
                index.get_type(),
                "",
            )
            .unwrap();
        let index = ctx.builder.build_int_mul(index, sizeof_elem, "").unwrap();
        let ptr = unsafe {
            ctx.builder
                .build_in_bounds_gep(
                    self.base_ptr(ctx, generator),
                    &[index],
                    name.unwrap_or_default(),
                )
                .unwrap()
        };
        // TODO: Current implementation is transparent
        ctx.builder
            .build_pointer_cast(
                ptr,
                BasicTypeEnum::try_from(self.element_type(ctx, generator))
                    .unwrap()
                    .ptr_type(AddressSpace::default()),
                "",
            )
            .unwrap()
    }
    fn ptr_offset<G: CodeGenerator + ?Sized>(
        &self,
        ctx: &mut CodeGenContext<'ctx, '_>,
        generator: &mut G,
        indices: &Index,
        name: Option<&str>,
    ) -> PointerValue<'ctx> {
        let llvm_usize = generator.get_size_type(ctx.ctx);
        let indices_size = indices.size(ctx, generator);
        let nidx_leq_ndims = ctx
            .builder
            .build_int_compare(IntPredicate::SLE, indices_size, self.0.load_ndims(ctx), "")
            .unwrap();
        ctx.make_assert(
            generator,
            nidx_leq_ndims,
            "0:IndexError",
            "invalid index to scalar variable",
            [None, None, None],
            ctx.current_loc,
        );
        let indices_len = indices.size(ctx, generator);
        let ndarray_len = self.0.load_ndims(ctx);
        let len = call_int_umin(ctx, indices_len, ndarray_len, None);
        gen_for_callback_incrementing(
            generator,
            ctx,
            None,
            llvm_usize.const_zero(),
            (len, false),
            |generator, ctx, _, i| {
                let (dim_idx, dim_sz) = unsafe {
                    (
                        indices.get_unchecked(ctx, generator, &i, None).into_int_value(),
                        self.0.shape().get_typed_unchecked(ctx, generator, &i, None),
                    )
                };
                let dim_idx = ctx
                    .builder
                    .build_int_z_extend_or_bit_cast(dim_idx, dim_sz.get_type(), "")
                    .unwrap();
                let dim_lt =
                    ctx.builder.build_int_compare(IntPredicate::SLT, dim_idx, dim_sz, "").unwrap();
                ctx.make_assert(
                    generator,
                    dim_lt,
                    "0:IndexError",
                    "index {0} is out of bounds for axis 0 with size {1}",
                    [Some(dim_idx), Some(dim_sz), None],
                    ctx.current_loc,
                );
                Ok(())
            },
            llvm_usize.const_int(1, false),
        )
        .unwrap();
        let ptr = unsafe { self.ptr_offset_unchecked(ctx, generator, indices, name) };
        // TODO: Current implementation is transparent
        ctx.builder
            .build_pointer_cast(
                ptr,
                BasicTypeEnum::try_from(self.element_type(ctx, generator))
                    .unwrap()
                    .ptr_type(AddressSpace::default()),
                "",
            )
            .unwrap()
    }
 }
 impl<'ctx, Index: UntypedArrayLikeAccessor<'ctx>> UntypedArrayLikeAccessor<'ctx, Index>
    for NDArrayDataProxy<'ctx, '_>
 {
 }
 impl<'ctx, Index: UntypedArrayLikeAccessor<'ctx>> UntypedArrayLikeMutator<'ctx, Index>
    for NDArrayDataProxy<'ctx, '_>
 {
 }
--- a/nac3core/src/codegen/values/range.rs
+++ b/nac3core/src/codegen/values/range.rs
@ -1,153 +0,0 @@
 use inkwell::values::{BasicValueEnum, IntValue, PointerValue};
 use super::ProxyValue;
 use crate::codegen::{types::RangeType, CodeGenContext};
 /// Proxy type for accessing a `range` value in LLVM.
 #[derive(Copy, Clone)]
 pub struct RangeValue<'ctx> {
    value: PointerValue<'ctx>,
    name: Option<&'ctx str>,
 }
 impl<'ctx> RangeValue<'ctx> {
    /// Checks whether `value` is an instance of `range`, returning [Err] if `value` is not an instance.
    pub fn is_representable(value: PointerValue<'ctx>) -> Result<(), String> {
        RangeType::is_representable(value.get_type())
    }
    /// Creates an [`RangeValue`] from a [`PointerValue`].
    #[must_use]
    pub fn from_pointer_value(ptr: PointerValue<'ctx>, name: Option<&'ctx str>) -> Self {
        debug_assert!(Self::is_representable(ptr).is_ok());
        RangeValue { value: ptr, name }
    }
    fn ptr_to_start(&self, ctx: &CodeGenContext<'ctx, '_>) -> PointerValue<'ctx> {
        let llvm_i32 = ctx.ctx.i32_type();
        let var_name = self.name.map(|v| format!("{v}.start.addr")).unwrap_or_default();
        unsafe {
            ctx.builder
                .build_in_bounds_gep(
                    self.as_base_value(),
                    &[llvm_i32.const_zero(), llvm_i32.const_int(0, false)],
                    var_name.as_str(),
                )
                .unwrap()
        }
    }
    fn ptr_to_end(&self, ctx: &CodeGenContext<'ctx, '_>) -> PointerValue<'ctx> {
        let llvm_i32 = ctx.ctx.i32_type();
        let var_name = self.name.map(|v| format!("{v}.end.addr")).unwrap_or_default();
        unsafe {
            ctx.builder
                .build_in_bounds_gep(
                    self.as_base_value(),
                    &[llvm_i32.const_zero(), llvm_i32.const_int(1, false)],
                    var_name.as_str(),
                )
                .unwrap()
        }
    }
    fn ptr_to_step(&self, ctx: &CodeGenContext<'ctx, '_>) -> PointerValue<'ctx> {
        let llvm_i32 = ctx.ctx.i32_type();
        let var_name = self.name.map(|v| format!("{v}.step.addr")).unwrap_or_default();
        unsafe {
            ctx.builder
                .build_in_bounds_gep(
                    self.as_base_value(),
                    &[llvm_i32.const_zero(), llvm_i32.const_int(2, false)],
                    var_name.as_str(),
                )
                .unwrap()
        }
    }
    /// Stores the `start` value into this instance.
    pub fn store_start(&self, ctx: &CodeGenContext<'ctx, '_>, start: IntValue<'ctx>) {
        debug_assert_eq!(start.get_type().get_bit_width(), 32);
        let pstart = self.ptr_to_start(ctx);
        ctx.builder.build_store(pstart, start).unwrap();
    }
    /// Returns the `start` value of this `range`.
    pub fn load_start(&self, ctx: &CodeGenContext<'ctx, '_>, name: Option<&str>) -> IntValue<'ctx> {
        let pstart = self.ptr_to_start(ctx);
        let var_name = name
            .map(ToString::to_string)
            .or_else(|| self.name.map(|v| format!("{v}.start")))
            .unwrap_or_default();
        ctx.builder
            .build_load(pstart, var_name.as_str())
            .map(BasicValueEnum::into_int_value)
            .unwrap()
    }
    /// Stores the `end` value into this instance.
    pub fn store_end(&self, ctx: &CodeGenContext<'ctx, '_>, end: IntValue<'ctx>) {
        debug_assert_eq!(end.get_type().get_bit_width(), 32);
        let pend = self.ptr_to_end(ctx);
        ctx.builder.build_store(pend, end).unwrap();
    }
    /// Returns the `end` value of this `range`.
    pub fn load_end(&self, ctx: &CodeGenContext<'ctx, '_>, name: Option<&str>) -> IntValue<'ctx> {
        let pend = self.ptr_to_end(ctx);
        let var_name = name
            .map(ToString::to_string)
            .or_else(|| self.name.map(|v| format!("{v}.end")))
            .unwrap_or_default();
        ctx.builder.build_load(pend, var_name.as_str()).map(BasicValueEnum::into_int_value).unwrap()
    }
    /// Stores the `step` value into this instance.
    pub fn store_step(&self, ctx: &CodeGenContext<'ctx, '_>, step: IntValue<'ctx>) {
        debug_assert_eq!(step.get_type().get_bit_width(), 32);
        let pstep = self.ptr_to_step(ctx);
        ctx.builder.build_store(pstep, step).unwrap();
    }
    /// Returns the `step` value of this `range`.
    pub fn load_step(&self, ctx: &CodeGenContext<'ctx, '_>, name: Option<&str>) -> IntValue<'ctx> {
        let pstep = self.ptr_to_step(ctx);
        let var_name = name
            .map(ToString::to_string)
            .or_else(|| self.name.map(|v| format!("{v}.step")))
            .unwrap_or_default();
        ctx.builder
            .build_load(pstep, var_name.as_str())
            .map(BasicValueEnum::into_int_value)
            .unwrap()
    }
 }
 impl<'ctx> ProxyValue<'ctx> for RangeValue<'ctx> {
    type Base = PointerValue<'ctx>;
    type Type = RangeType<'ctx>;
    fn get_type(&self) -> Self::Type {
        RangeType::from_type(self.value.get_type())
    }
    fn as_base_value(&self) -> Self::Base {
        self.value
    }
 }
 impl<'ctx> From<RangeValue<'ctx>> for PointerValue<'ctx> {
    fn from(value: RangeValue<'ctx>) -> Self {
        value.as_base_value()
    }
 }
--- a/nac3core/src/lib.rs
+++ b/nac3core/src/lib.rs
@ -1,4 +1,10 @@
-#![deny(future_incompatible, let_underscore, nonstandard_style, clippy::all)]
+#![deny(
    future_incompatible,
    let_underscore,
    nonstandard_style,
    rust_2024_compatibility,
    clippy::all
 )]
 #![warn(clippy::pedantic)]
 #![allow(
    dead_code,
@ -21,5 +27,3 @@ pub mod codegen;
 pub mod symbol_resolver;
 pub mod toplevel;
 pub mod typecheck;
 extern crate self as nac3core;
--- a/nac3core/src/toplevel/builtins.rs
+++ b/nac3core/src/toplevel/builtins.rs
@ -11,18 +11,18 @@ use itertools::Either;
 use strum::IntoEnumIterator;
 use super::{
-    helper::{debug_assert_prim_is_allowed, make_exception_fields, PrimDef, PrimDefDetails},
+    helper::{debug_assert_prim_is_allowed, make_exception_fields, PrimDefDetails},
    numpy::make_ndarray_ty,
    *,
 };
 use crate::{
    codegen::{
        builtin_fns,
        classes::{ProxyValue, RangeValue},
        numpy::*,
        stmt::exn_constructor,
        values::{ProxyValue, RangeValue},
    },
    symbol_resolver::SymbolValue,
    toplevel::{helper::PrimDef, numpy::make_ndarray_ty},
    typecheck::typedef::{into_var_map, iter_type_vars, TypeVar, VarMap},
 };
@ -710,7 +710,7 @@ impl<'a> BuiltinBuilder<'a> {
                        let (zelf_ty, zelf) = obj.unwrap();
                        let zelf =
                            zelf.to_basic_value_enum(ctx, generator, zelf_ty)?.into_pointer_value();
-                        let zelf = RangeValue::from_pointer_value(zelf, Some("range"));
+                        let zelf = RangeValue::from_ptr_val(zelf, Some("range"));
                        let mut start = None;
                        let mut stop = None;
--- a/nac3core/src/toplevel/composer.rs
+++ b/nac3core/src/toplevel/composer.rs
--- a/nac3core/src/toplevel/helper.rs
+++ b/nac3core/src/toplevel/helper.rs
@ -3,11 +3,13 @@ use std::convert::TryInto;
 use strum::IntoEnumIterator;
 use strum_macros::EnumIter;
-use nac3parser::ast::{Constant, ExprKind, Location};
+use ast::ExprKind;
 use nac3parser::ast::{Constant, Location};
-use super::{numpy::unpack_ndarray_var_tys, *};
+use super::*;
 use crate::{
    symbol_resolver::SymbolValue,
    toplevel::numpy::unpack_ndarray_var_tys,
    typecheck::typedef::{into_var_map, iter_type_vars, Mapping, TypeVarId, VarMap},
 };
@ -598,7 +600,7 @@ impl TopLevelComposer {
        name: String,
        simple_name: StrRef,
        ty: Type,
-        ty_decl: Option<Expr>,
+        ty_decl: Expr,
        resolver: Option<Arc<dyn SymbolResolver + Send + Sync>>,
        loc: Option<Location>,
    ) -> TopLevelDef {
@ -624,6 +626,64 @@ impl TopLevelComposer {
        Err(HashSet::from([format!("no method {method_name} in the current class")]))
    }
    /// get all base class def id of a class, excluding itself. \
    /// this function should called only after the direct parent is set
    /// and before all the ancestors are set
    /// and when we allow single inheritance \
    /// the order of the returned list is from the child to the deepest ancestor
    pub fn get_all_ancestors_helper(
        child: &TypeAnnotation,
        temp_def_list: &[Arc<RwLock<TopLevelDef>>],
    ) -> Result<Vec<TypeAnnotation>, HashSet<String>> {
        let mut result: Vec<TypeAnnotation> = Vec::new();
        let mut parent = Self::get_parent(child, temp_def_list);
        while let Some(p) = parent {
            parent = Self::get_parent(&p, temp_def_list);
            let p_id = if let TypeAnnotation::CustomClass { id, .. } = &p {
                *id
            } else {
                unreachable!("must be class kind annotation")
            };
            // check cycle
            let no_cycle = result.iter().all(|x| {
                let TypeAnnotation::CustomClass { id, .. } = x else {
                    unreachable!("must be class kind annotation")
                };
                id.0 != p_id.0
            });
            if no_cycle {
                result.push(p);
            } else {
                return Err(HashSet::from(["cyclic inheritance detected".into()]));
            }
        }
        Ok(result)
    }
    /// should only be called when finding all ancestors, so panic when wrong
    fn get_parent(
        child: &TypeAnnotation,
        temp_def_list: &[Arc<RwLock<TopLevelDef>>],
    ) -> Option<TypeAnnotation> {
        let child_id = if let TypeAnnotation::CustomClass { id, .. } = child {
            *id
        } else {
            unreachable!("should be class type annotation")
        };
        let child_def = temp_def_list.get(child_id.0).unwrap();
        let child_def = child_def.read();
        let TopLevelDef::Class { ancestors, .. } = &*child_def else {
            unreachable!("child must be top level class def")
        };
        if ancestors.is_empty() {
            None
        } else {
            Some(ancestors[0].clone())
        }
    }
    /// get the `var_id` of a given `TVar` type
    pub fn get_var_id(var_ty: Type, unifier: &mut Unifier) -> Result<TypeVarId, HashSet<String>> {
        if let TypeEnum::TVar { id, .. } = unifier.get_ty(var_ty).as_ref() {
@ -933,139 +993,6 @@ impl TopLevelComposer {
            ))
        }
    }
    /// Parses the class type variables and direct parents
    /// we only allow single inheritance
    pub fn analyze_class_bases(
        class_def: &Arc<RwLock<TopLevelDef>>,
        class_ast: &Option<Stmt>,
        temp_def_list: &[Arc<RwLock<TopLevelDef>>],
        unifier: &mut Unifier,
        primitives_store: &PrimitiveStore,
    ) -> Result<(), HashSet<String>> {
        let mut class_def = class_def.write();
        let (class_def_id, class_ancestors, class_bases_ast, class_type_vars, class_resolver) = {
            let TopLevelDef::Class { object_id, ancestors, type_vars, resolver, .. } =
                &mut *class_def
            else {
                unreachable!()
            };
            let Some(ast::Located { node: ast::StmtKind::ClassDef { bases, .. }, .. }) = class_ast
            else {
                unreachable!()
            };
            (object_id, ancestors, bases, type_vars, resolver.as_ref().unwrap().as_ref())
        };
        let mut is_generic = false;
        let mut has_base = false;
        // Check class bases for typevars
        for b in class_bases_ast {
            match &b.node {
                // analyze typevars bounded to the class,
                // only support things like `class A(Generic[T, V])`,
                // things like `class A(Generic[T, V, ImportedModule.T])` is not supported
                // i.e. only simple names are allowed in the subscript
                // should update the TopLevelDef::Class.typevars and the TypeEnum::TObj.params
                ast::ExprKind::Subscript { value, slice, .. } if matches!(&value.node, ast::ExprKind::Name { id, .. } if id == &"Generic".into()) =>
                {
                    if is_generic {
                        return Err(HashSet::from([format!(
                            "only single Generic[...] is allowed (at {})",
                            b.location
                        )]));
                    }
                    is_generic = true;
                    let type_var_list: Vec<&ast::Expr<()>>;
                    // if `class A(Generic[T, V, G])`
                    if let ast::ExprKind::Tuple { elts, .. } = &slice.node {
                        type_var_list = elts.iter().collect_vec();
                    // `class A(Generic[T])`
                    } else {
                        type_var_list = vec![&**slice];
                    }
                    let type_vars = type_var_list
                        .into_iter()
                        .map(|e| {
                            class_resolver.parse_type_annotation(
                                temp_def_list,
                                unifier,
                                primitives_store,
                                e,
                            )
                        })
                        .collect::<Result<Vec<_>, _>>()?;
                    class_type_vars.extend(type_vars);
                }
                ast::ExprKind::Name { .. } | ast::ExprKind::Subscript { .. } => {
                    if has_base {
                        return Err(HashSet::from([format!("a class definition can only have at most one base class declaration and one generic declaration (at {})", b.location )]));
                    }
                    has_base = true;
                    // the function parse_ast_to make sure that no type var occurred in
                    // bast_ty if it is a CustomClassKind
                    let base_ty = parse_ast_to_type_annotation_kinds(
                        class_resolver,
                        temp_def_list,
                        unifier,
                        primitives_store,
                        b,
                        vec![(*class_def_id, class_type_vars.clone())]
                            .into_iter()
                            .collect::<HashMap<_, _>>(),
                    )?;
                    if let TypeAnnotation::CustomClass { .. } = &base_ty {
                        class_ancestors.push(base_ty);
                    } else {
                        return Err(HashSet::from([format!(
                            "class base declaration can only be custom class (at {})",
                            b.location
                        )]));
                    }
                }
                _ => {
                    return Err(HashSet::from([format!(
                        "unsupported statement in class defintion (at {})",
                        b.location
                    )]));
                }
            }
        }
        Ok(())
    }
    /// gets all ancestors of a class
    pub fn analyze_class_ancestors(
        class_def: &Arc<RwLock<TopLevelDef>>,
        temp_def_list: &[Arc<RwLock<TopLevelDef>>],
    ) {
        // Check if class has a direct parent
        let mut class_def = class_def.write();
        let TopLevelDef::Class { ancestors, type_vars, object_id, .. } = &mut *class_def else {
            unreachable!()
        };
        let mut anc_set = HashMap::new();
        if let Some(ancestor) = ancestors.first() {
            let TypeAnnotation::CustomClass { id, .. } = ancestor else { unreachable!() };
            let TopLevelDef::Class { ancestors: parent_ancestors, .. } =
                &*temp_def_list[id.0].read()
            else {
                unreachable!()
            };
            for anc in parent_ancestors.iter().skip(1) {
                let TypeAnnotation::CustomClass { id, .. } = anc else { unreachable!() };
                anc_set.insert(id, anc.clone());
            }
            ancestors.extend(anc_set.into_values());
        }
        // push `self` as first ancestor of class
        ancestors.insert(0, make_self_type_annotation(type_vars.as_slice(), *object_id));
    }
 }
 pub fn parse_parameter_default_value(
@ -1209,23 +1136,3 @@ pub fn arraylike_get_ndims(unifier: &mut Unifier, ty: Type) -> u64 {
        _ => 0,
    }
 }
 /// Extract an ndarray's `ndims` [type][`Type`] in `u64`. Panic if not possible.
 /// The `ndims` must only contain 1 value.
 #[must_use]
 pub fn extract_ndims(unifier: &Unifier, ndims_ty: Type) -> u64 {
    let ndims_ty_enum = unifier.get_ty_immutable(ndims_ty);
    let TypeEnum::TLiteral { values, .. } = &*ndims_ty_enum else {
        panic!("ndims_ty should be a TLiteral");
    };
    assert_eq!(values.len(), 1, "ndims_ty TLiteral should only contain 1 value");
    let ndims = values[0].clone();
    u64::try_from(ndims).unwrap()
 }
 /// Return an ndarray's `ndims` as a typechecker [`Type`] from its `u64` value.
 pub fn create_ndims(unifier: &mut Unifier, ndims: u64) -> Type {
    unifier.get_fresh_literal(vec![SymbolValue::U64(ndims)], None)
 }
--- a/nac3core/src/toplevel/mod.rs
+++ b/nac3core/src/toplevel/mod.rs
@ -23,19 +23,19 @@ use crate::{
        },
    },
 };
-use composer::*;
+
-use type_annotation::*;
+#[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Copy, Hash, Debug)]
 pub struct DefinitionId(pub usize);
 pub mod builtins;
 pub mod composer;
 pub mod helper;
 pub mod numpy;
 pub mod type_annotation;
 use composer::*;
 use type_annotation::*;
 #[cfg(test)]
 mod test;
 pub mod type_annotation;
 #[derive(PartialEq, Eq, PartialOrd, Ord, Clone, Copy, Hash, Debug)]
 pub struct DefinitionId(pub usize);
 type GenCallCallback = dyn for<'ctx, 'a> Fn(
        &mut CodeGenContext<'ctx, 'a>,
@ -158,8 +158,8 @@ pub enum TopLevelDef {
        /// Type of the global variable.
        ty: Type,
-        /// The declared type of the global variable, or [`None`] if no type annotation is provided.
+        /// The declared type of the global variable.
-        ty_decl: Option<Expr>,
+        ty_decl: Expr,
        /// Symbol resolver of the module defined the class.
        resolver: Option<Arc<dyn SymbolResolver + Send + Sync>>,
--- a/nac3core/src/toplevel/numpy.rs
+++ b/nac3core/src/toplevel/numpy.rs
@ -1,9 +1,11 @@
 use itertools::Itertools;
-use super::helper::PrimDef;
+use crate::{
-use crate::typecheck::{
+    toplevel::helper::PrimDef,
-    type_inferencer::PrimitiveStore,
+    typecheck::{
-    typedef::{Type, TypeEnum, TypeVarId, Unifier, VarMap},
+        type_inferencer::PrimitiveStore,
        typedef::{Type, TypeEnum, TypeVarId, Unifier, VarMap},
    },
 };
 /// Creates a `ndarray` [`Type`] with the given type arguments.
--- a/nac3core/src/toplevel/snapshots/nac3coretopleveltest__test_analyze__generic_class.snap
+++ b/nac3core/src/toplevel/snapshots/nac3coretopleveltest__test_analyze__generic_class.snap
@ -3,10 +3,10 @@ source: nac3core/src/toplevel/test.rs
 expression: res_vec
 ---
 [
    "Class {\nname: \"Generic_A\",\nancestors: [\"Generic_A[V]\", \"B\"],\nfields: [\"aa\", \"a\"],\nmethods: [(\"__init__\", \"fn[[], none]\"), (\"foo\", \"fn[[b:T], none]\"), (\"fun\", \"fn[[a:int32], V]\")],\ntype_vars: [\"V\"]\n}\n",
    "Function {\nname: \"Generic_A.__init__\",\nsig: \"fn[[], none]\",\nvar_id: []\n}\n",
    "Function {\nname: \"Generic_A.fun\",\nsig: \"fn[[a:int32], V]\",\nvar_id: [TypeVarId(241)]\n}\n",
    "Class {\nname: \"B\",\nancestors: [\"B\"],\nfields: [\"aa\"],\nmethods: [(\"__init__\", \"fn[[], none]\"), (\"foo\", \"fn[[b:T], none]\")],\ntype_vars: []\n}\n",
    "Function {\nname: \"B.__init__\",\nsig: \"fn[[], none]\",\nvar_id: []\n}\n",
    "Function {\nname: \"B.foo\",\nsig: \"fn[[b:T], none]\",\nvar_id: []\n}\n",
    "Class {\nname: \"Generic_A\",\nancestors: [\"Generic_A[V]\", \"B\"],\nfields: [\"aa\", \"a\"],\nmethods: [(\"__init__\", \"fn[[], none]\"), (\"foo\", \"fn[[b:T], none]\"), (\"fun\", \"fn[[a:int32], V]\")],\ntype_vars: [\"V\"]\n}\n",
    "Function {\nname: \"Generic_A.__init__\",\nsig: \"fn[[], none]\",\nvar_id: []\n}\n",
    "Function {\nname: \"Generic_A.fun\",\nsig: \"fn[[a:int32], V]\",\nvar_id: [TypeVarId(246)]\n}\n",
 ]
--- a/nac3core/src/toplevel/snapshots/nac3coretopleveltest__test_analyze__simple_class_compose.snap
+++ b/nac3core/src/toplevel/snapshots/nac3coretopleveltest__test_analyze__simple_class_compose.snap
@ -7,11 +7,11 @@ expression: res_vec
    "Function {\nname: \"A.__init__\",\nsig: \"fn[[], none]\",\nvar_id: []\n}\n",
    "Function {\nname: \"A.fun\",\nsig: \"fn[[b:B], none]\",\nvar_id: []\n}\n",
    "Function {\nname: \"A.foo\",\nsig: \"fn[[a:T, b:V], none]\",\nvar_id: [TypeVarId(249)]\n}\n",
    "Class {\nname: \"B\",\nancestors: [\"B\", \"C\", \"A\"],\nfields: [\"a\"],\nmethods: [(\"__init__\", \"fn[[], none]\"), (\"fun\", \"fn[[b:B], none]\"), (\"foo\", \"fn[[a:T, b:V], none]\")],\ntype_vars: []\n}\n",
    "Function {\nname: \"B.__init__\",\nsig: \"fn[[], none]\",\nvar_id: []\n}\n",
    "Class {\nname: \"C\",\nancestors: [\"C\", \"A\"],\nfields: [\"a\"],\nmethods: [(\"__init__\", \"fn[[], none]\"), (\"fun\", \"fn[[b:B], none]\"), (\"foo\", \"fn[[a:T, b:V], none]\")],\ntype_vars: []\n}\n",
    "Function {\nname: \"C.__init__\",\nsig: \"fn[[], none]\",\nvar_id: []\n}\n",
    "Function {\nname: \"C.fun\",\nsig: \"fn[[b:B], none]\",\nvar_id: []\n}\n",
    "Class {\nname: \"B\",\nancestors: [\"B\", \"C\", \"A\"],\nfields: [\"a\"],\nmethods: [(\"__init__\", \"fn[[], none]\"), (\"fun\", \"fn[[b:B], none]\"), (\"foo\", \"fn[[a:T, b:V], none]\")],\ntype_vars: []\n}\n",
    "Function {\nname: \"B.__init__\",\nsig: \"fn[[], none]\",\nvar_id: []\n}\n",
    "Function {\nname: \"foo\",\nsig: \"fn[[a:A], none]\",\nvar_id: []\n}\n",
    "Function {\nname: \"ff\",\nsig: \"fn[[a:T], V]\",\nvar_id: [TypeVarId(257)]\n}\n",
 ]
--- a/nac3core/src/toplevel/test.rs
+++ b/nac3core/src/toplevel/test.rs
@ -9,10 +9,11 @@ use nac3parser::{
    parser::parse_program,
 };
-use super::{helper::PrimDef, DefinitionId, *};
+use super::*;
 use crate::{
    codegen::CodeGenContext,
    symbol_resolver::{SymbolResolver, ValueEnum},
    toplevel::{helper::PrimDef, DefinitionId},
    typecheck::{
        type_inferencer::PrimitiveStore,
        typedef::{into_var_map, Type, Unifier},
@ -229,6 +230,11 @@ fn test_simple_function_analyze(source: &[&str], tys: &[&str], names: &[&str]) {
                def foo(self, a: T, b: V):
                    pass
        "},
        indoc! {"
            class B(C):
                def __init__(self):
                    pass
        "},
        indoc! {"
            class C(A):
                def __init__(self):
@ -237,11 +243,6 @@ fn test_simple_function_analyze(source: &[&str], tys: &[&str], names: &[&str]) {
                    a = 1
                    pass
        "},
        indoc! {"
            class B(C):
                def __init__(self):
                    pass
        "},
        indoc! {"
            def foo(a: A):
                pass
@ -256,14 +257,6 @@ fn test_simple_function_analyze(source: &[&str], tys: &[&str], names: &[&str]) {
 )]
 #[test_case(
    &[
        indoc! {"
        class B:
            aa: bool
            def __init__(self):
                self.aa = False
            def foo(self, b: T):
                pass
        "},
        indoc! {"
            class Generic_A(Generic[V], B):
                a: int64
@ -271,6 +264,14 @@ fn test_simple_function_analyze(source: &[&str], tys: &[&str], names: &[&str]) {
                    self.a = 123123123123
                def fun(self, a: int32) -> V:
                    pass
        "},
        indoc! {"
            class B:
                aa: bool
                def __init__(self):
                    self.aa = False
                def foo(self, b: T):
                    pass
        "}
    ],
    &[];
@ -390,18 +391,18 @@ fn test_simple_function_analyze(source: &[&str], tys: &[&str], names: &[&str]) {
                    pass
        "}
    ],
-    &["NameError: name 'B' is not defined (at unknown:1:9)"];
+    &["cyclic inheritance detected"];
    "cyclic1"
 )]
 #[test_case(
    &[
        indoc! {"
-        class B(Generic[V, T], C[int32]):
+            class A(B[bool, int64]):
-            def __init__(self):
+                def __init__(self):
-                pass
+                    pass
        "},
        indoc! {"
-            class A(B[bool, int64]):
+            class B(Generic[V, T], C[int32]):
                def __init__(self):
                    pass
        "},
@ -411,7 +412,7 @@ fn test_simple_function_analyze(source: &[&str], tys: &[&str], names: &[&str]) {
                    pass
        "},
    ],
-    &["NameError: name 'C' is not defined (at unknown:1:25)"];
+    &["cyclic inheritance detected"];
    "cyclic2"
 )]
 #[test_case(
@ -435,6 +436,11 @@ fn test_simple_function_analyze(source: &[&str], tys: &[&str], names: &[&str]) {
 )]
 #[test_case(
    &[
        indoc! {"
            class A(B, Generic[T], C):
                def __init__(self):
                    pass
        "},
        indoc! {"
            class B:
                def __init__(self):
@ -444,11 +450,6 @@ fn test_simple_function_analyze(source: &[&str], tys: &[&str], names: &[&str]) {
            class C:
                def __init__(self):
                    pass
        "},
        indoc! {"
        class A(B, Generic[T], C):
            def __init__(self):
                pass
        "}
    ],
--- a/nac3core/src/toplevel/type_annotation.rs
+++ b/nac3core/src/toplevel/type_annotation.rs
@ -2,11 +2,12 @@ use strum::IntoEnumIterator;
 use nac3parser::ast::Constant;
-use super::{
+use super::*;
-    helper::{PrimDef, PrimDefDetails},
+use crate::{
-    *,
+    symbol_resolver::SymbolValue,
    toplevel::helper::{PrimDef, PrimDefDetails},
    typecheck::typedef::VarMap,
 };
 use crate::{symbol_resolver::SymbolValue, typecheck::typedef::VarMap};
 #[derive(Clone, Debug)]
 pub enum TypeAnnotation {
@ -100,13 +101,7 @@ pub fn parse_ast_to_type_annotation_kinds<T, S: std::hash::BuildHasher + Clone>(
            Ok(TypeAnnotation::CustomClass { id: PrimDef::Exception.id(), params: Vec::default() })
        } else if let Ok(obj_id) = resolver.get_identifier_def(*id) {
            let type_vars = {
-                let Some(top_level_def) = top_level_defs.get(obj_id.0) else {
+                let def_read = top_level_defs[obj_id.0].try_read();
                    return Err(HashSet::from([format!(
                        "NameError: name '{id}' is not defined (at {})",
                        expr.location
                    )]));
                };
                let def_read = top_level_def.try_read();
                if let Some(def_read) = def_read {
                    if let TopLevelDef::Class { type_vars, .. } = &*def_read {
                        type_vars.clone()
@ -161,17 +156,12 @@ pub fn parse_ast_to_type_annotation_kinds<T, S: std::hash::BuildHasher + Clone>(
            }
            let obj_id = resolver.get_identifier_def(*id)?;
            let type_vars = {
-                let Some(top_level_def) = top_level_defs.get(obj_id.0) else {
+                let def_read = top_level_defs[obj_id.0].try_read();
                    return Err(HashSet::from([format!(
                        "NameError: name '{id}' is not defined (at {})",
                        expr.location
                    )]));
                };
                let def_read = top_level_def.try_read();
                if let Some(def_read) = def_read {
                    let TopLevelDef::Class { type_vars, .. } = &*def_read else {
                        unreachable!("must be class here")
                    };
                    type_vars.clone()
                } else {
                    locked.get(&obj_id).unwrap().clone()
--- a/nac3core/src/typecheck/function_check.rs
+++ b/nac3core/src/typecheck/function_check.rs
@ -10,7 +10,7 @@ use nac3parser::ast::{
 };
 use super::{
-    type_inferencer::{DeclarationSource, IdentifierInfo, Inferencer},
+    type_inferencer::{IdentifierInfo, Inferencer},
    typedef::{Type, TypeEnum},
 };
 use crate::toplevel::helper::PrimDef;
@ -34,20 +34,6 @@ impl<'a> Inferencer<'a> {
                Err(HashSet::from([format!("cannot assign to a `none` (at {})", pattern.location)]))
            }
            ExprKind::Name { id, .. } => {
                // If `id` refers to a declared symbol, reject this assignment if it is used in the
                // context of an (implicit) global variable
                if let Some(id_info) = defined_identifiers.get(id) {
                    if matches!(
                        id_info.source,
                        DeclarationSource::Global { is_explicit: Some(false) }
                    ) {
                        return Err(HashSet::from([format!(
                            "cannot access local variable '{id}' before it is declared (at {})",
                            pattern.location
                        )]));
                    }
                }
                if !defined_identifiers.contains_key(id) {
                    defined_identifiers.insert(*id, IdentifierInfo::default());
                }
@ -118,22 +104,7 @@ impl<'a> Inferencer<'a> {
                        *id,
                    ) {
                        Ok(_) => {
-                            let is_global = self.is_id_global(*id);
+                            self.defined_identifiers.insert(*id, IdentifierInfo::default());
                            defined_identifiers.insert(
                                *id,
                                IdentifierInfo {
                                    source: match is_global {
                                        Some(true) => {
                                            DeclarationSource::Global { is_explicit: Some(false) }
                                        }
                                        Some(false) => {
                                            DeclarationSource::Global { is_explicit: None }
                                        }
                                        None => DeclarationSource::Local,
                                    },
                                },
                            );
                        }
                        Err(e) => {
                            return Err(HashSet::from([format!(
@ -397,9 +368,9 @@ impl<'a> Inferencer<'a> {
            StmtKind::Global { names, .. } => {
                for id in names {
                    if let Some(id_info) = defined_identifiers.get(id) {
-                        if id_info.source == DeclarationSource::Local {
+                        if !id_info.is_global {
                            return Err(HashSet::from([format!(
-                                "name '{id}' is referenced prior to global declaration at {}",
+                                "name '{id}' is assigned to before global declaration at {}",
                                stmt.location,
                            )]));
                        }
@ -414,12 +385,8 @@ impl<'a> Inferencer<'a> {
                        *id,
                    ) {
                        Ok(_) => {
-                            defined_identifiers.insert(
+                            self.defined_identifiers
-                                *id,
+                                .insert(*id, IdentifierInfo { is_global: true });
                                IdentifierInfo {
                                    source: DeclarationSource::Global { is_explicit: Some(true) },
                                },
                            );
                        }
                        Err(e) => {
                            return Err(HashSet::from([format!(
--- a/nac3core/src/typecheck/magic_methods.rs
+++ b/nac3core/src/typecheck/magic_methods.rs
@ -5,16 +5,16 @@ use strum::IntoEnumIterator;
 use nac3parser::ast::{Cmpop, Operator, StrRef, Unaryop};
 use super::{
    type_inferencer::*,
    typedef::{FunSignature, FuncArg, Type, TypeEnum, Unifier, VarMap},
 };
 use crate::{
    symbol_resolver::SymbolValue,
    toplevel::{
        helper::PrimDef,
        numpy::{make_ndarray_ty, unpack_ndarray_var_tys},
    },
    typecheck::{
        type_inferencer::*,
        typedef::{FunSignature, FuncArg, Type, TypeEnum, Unifier, VarMap},
    },
 };
 /// The variant of a binary operator.
--- a/nac3core/src/typecheck/type_error.rs
+++ b/nac3core/src/typecheck/type_error.rs
@ -5,9 +5,10 @@ use itertools::Itertools;
 use nac3parser::ast::{Cmpop, Location, StrRef};
 use super::{
-    magic_methods::{Binop, HasOpInfo},
+    magic_methods::Binop,
-    typedef::{RecordKey, Type, TypeEnum, Unifier},
+    typedef::{RecordKey, Type, Unifier},
 };
 use crate::typecheck::{magic_methods::HasOpInfo, typedef::TypeEnum};
 #[derive(Debug, Clone)]
 pub enum TypeErrorKind {
--- a/nac3core/src/typecheck/type_inferencer/mod.rs
+++ b/nac3core/src/typecheck/type_inferencer/mod.rs
@ -12,7 +12,7 @@ use itertools::{izip, Itertools};
 use nac3parser::ast::{
    self,
    fold::{self, Fold},
-    Arguments, Comprehension, ExprContext, ExprKind, Ident, Located, Location, StrRef,
+    Arguments, Comprehension, ExprContext, ExprKind, Located, Location, StrRef,
 };
 use super::{
@ -88,31 +88,11 @@ impl PrimitiveStore {
    }
 }
 /// The location where an identifier declaration refers to.
 #[derive(Clone, Copy, Debug, Eq, PartialEq)]
 pub enum DeclarationSource {
    /// Local scope.
    Local,
    /// Global scope.
    Global {
        /// Whether the identifier is declared by the use of `global` statement. This field is
        /// [`None`] if the identifier does not refer to a variable.
        is_explicit: Option<bool>,
    },
 }
 /// Information regarding a defined identifier.
-#[derive(Clone, Copy, Debug)]
+#[derive(Clone, Copy, Debug, Default)]
 pub struct IdentifierInfo {
    /// Whether this identifier refers to a global variable.
-    pub source: DeclarationSource,
+    pub is_global: bool,
 }
 impl Default for IdentifierInfo {
    fn default() -> Self {
        IdentifierInfo { source: DeclarationSource::Local }
    }
 }
 impl IdentifierInfo {
@ -536,8 +516,9 @@ impl<'a> Fold<()> for Inferencer<'a> {
            }
            ast::StmtKind::Assert { test, msg, .. } => {
                self.unify(test.custom.unwrap(), self.primitives.bool, &test.location)?;
-                if let Some(m) = msg {
+                match msg {
-                    self.unify(m.custom.unwrap(), self.primitives.str, &m.location)?;
+                    Some(m) => self.unify(m.custom.unwrap(), self.primitives.str, &m.location)?,
                    None => (),
                }
            }
            _ => return report_error("Unsupported statement type", stmt.location),
@ -593,22 +574,7 @@ impl<'a> Fold<()> for Inferencer<'a> {
                            *id,
                        ) {
                            Ok(_) => {
-                                let is_global = self.is_id_global(*id);
+                                self.defined_identifiers.insert(*id, IdentifierInfo::default());
                                self.defined_identifiers.insert(
                                    *id,
                                    IdentifierInfo {
                                        source: match is_global {
                                            Some(true) => DeclarationSource::Global {
                                                is_explicit: Some(false),
                                            },
                                            Some(false) => {
                                                DeclarationSource::Global { is_explicit: None }
                                            }
                                            None => DeclarationSource::Local,
                                        },
                                    },
                                );
                            }
                            Err(e) => {
                                return report_error(
@ -2684,22 +2650,4 @@ impl<'a> Inferencer<'a> {
        self.constrain(body.custom.unwrap(), orelse.custom.unwrap(), &body.location)?;
        Ok(body.custom.unwrap())
    }
    /// Determines whether the given `id` refers to a global symbol.
    ///
    /// Returns `Some(true)` if `id` refers to a global variable, `Some(false)` if `id` refers to a
    /// class/function, and `None` if `id` refers to a local symbol.
    pub(super) fn is_id_global(&self, id: Ident) -> Option<bool> {
        self.top_level
            .definitions
            .read()
            .iter()
            .map(|def| match *def.read() {
                TopLevelDef::Class { name, .. } => (name, false),
                TopLevelDef::Function { simple_name, .. } => (simple_name, false),
                TopLevelDef::Variable { simple_name, .. } => (simple_name, true),
            })
            .find(|(global, _)| global == &id)
            .map(|(_, has_explicit_prop)| has_explicit_prop)
    }
 }
--- a/nac3core/src/typecheck/typedef/mod.rs
+++ b/nac3core/src/typecheck/typedef/mod.rs
@ -14,14 +14,14 @@ use itertools::{repeat_n, Itertools};
 use nac3parser::ast::{Cmpop, Location, StrRef, Unaryop};
 use super::{
-    magic_methods::{Binop, HasOpInfo, OpInfo},
+    magic_methods::{Binop, HasOpInfo},
    type_error::{TypeError, TypeErrorKind},
    type_inferencer::PrimitiveStore,
    unification_table::{UnificationKey, UnificationTable},
 };
 use crate::{
    symbol_resolver::SymbolValue,
    toplevel::{helper::PrimDef, DefinitionId, TopLevelContext, TopLevelDef},
    typecheck::{magic_methods::OpInfo, type_inferencer::PrimitiveStore},
 };
 #[cfg(test)]
--- a/nac3ld/src/dwarf.rs
+++ b/nac3ld/src/dwarf.rs
@ -24,15 +24,26 @@ pub const DW_EH_PE_aligned: u8 = 0x50;
 pub const DW_EH_PE_indirect: u8 = 0x80;
 #[derive(Clone)]
 pub struct DwarfReader<'a> {
    pub slice: &'a [u8],
    pub virt_addr: u32,
    base_slice: &'a [u8],
    base_virt_addr: u32,
 }
 impl<'a> DwarfReader<'a> {
    pub fn new(slice: &[u8], virt_addr: u32) -> DwarfReader {
-        DwarfReader { slice, virt_addr }
+        DwarfReader { slice, virt_addr, base_slice: slice, base_virt_addr: virt_addr }
    }
    /// Creates a new instance from another instance of [DwarfReader], optionally removing any
    /// offsets previously applied to the other instance.
    pub fn from_reader(other: &DwarfReader<'a>, reset_offset: bool) -> DwarfReader<'a> {
        if reset_offset {
            DwarfReader::new(other.base_slice, other.base_virt_addr)
        } else {
            DwarfReader::new(other.slice, other.virt_addr)
        }
    }
    pub fn offset(&mut self, offset: u32) {
@ -79,7 +90,6 @@ impl<'a> DwarfReader<'a> {
    pub fn read_u8(&mut self) -> u8 {
        let val = self.slice[0];
        self.slice = &self.slice[1..];
        self.virt_addr += 1;
        val
    }
 }
@ -91,7 +101,6 @@ macro_rules! impl_read_fn {
                pub fn $byteorder_fn(&mut self) -> $type {
                    let val = LittleEndian::$byteorder_fn(self.slice);
                    self.slice = &self.slice[mem::size_of::<$type>()..];
                    self.virt_addr += mem::size_of::<$type>() as u32;
                    val
                }
            )*
@ -217,7 +226,7 @@ impl<'a> EH_Frame<'a> {
    /// Returns an [Iterator] over all Call Frame Information (CFI) records.
    pub fn cfi_records(&self) -> CFI_Records<'a> {
-        let reader = self.reader.clone();
+        let reader = DwarfReader::from_reader(&self.reader, true);
        let len = reader.slice.len();
        CFI_Records { reader, available: len }
@ -248,7 +257,7 @@ impl<'a> CFI_Record<'a> {
            0xFFFF_FFFF => unimplemented!(),
            _ => {
-                let mut fde_reader = cie_reader.clone();
+                let mut fde_reader = DwarfReader::from_reader(cie_reader, false);
                fde_reader.offset(length);
                fde_reader
            }
@ -267,7 +276,7 @@ impl<'a> CFI_Record<'a> {
        // Skip code/data alignment factors & return address register along the way as well
        // We only tackle the case where 'z' and 'R' are part of the augmentation string, otherwise
        // we cannot get the addresses to make .eh_frame_hdr
-        let mut aug_data_reader = cie_reader.clone();
+        let mut aug_data_reader = DwarfReader::from_reader(cie_reader, false);
        let mut aug_str_len = 0;
        loop {
            if aug_data_reader.read_u8() == b'\0' {
@ -310,7 +319,7 @@ impl<'a> CFI_Record<'a> {
    /// Returns a [DwarfReader] initialized to the first Frame Description Entry (FDE) of this CFI
    /// record.
    pub fn get_fde_reader(&self) -> DwarfReader<'a> {
-        self.fde_reader.clone()
+        DwarfReader::from_reader(&self.fde_reader, true)
    }
    /// Returns an [Iterator] over all Frame Description Entries (FDEs).
@ -338,7 +347,7 @@ impl<'a> Iterator for CFI_Records<'a> {
                return None;
            }
-            let mut this_reader = self.reader.clone();
+            let mut this_reader = DwarfReader::from_reader(&self.reader, false);
            // Remove the length of the header and the content from the counter
            let length = self.reader.read_u32();
@ -351,7 +360,7 @@ impl<'a> Iterator for CFI_Records<'a> {
            // Remove the length of the header and the content from the counter
            self.available -= length + mem::size_of::<u32>();
-            let mut next_reader = self.reader.clone();
+            let mut next_reader = DwarfReader::from_reader(&self.reader, false);
            next_reader.offset(length as u32);
            let cie_ptr = self.reader.read_u32();
@ -387,8 +396,6 @@ impl<'a> Iterator for FDE_Records<'a> {
            return None;
        }
        let fde_addr = self.reader.virt_addr;
        // Remove the length of the header and the content from the counter
        let length = match self.reader.read_u32() {
            // eh_frame with 0-length means the CIE is terminated
@ -399,14 +406,14 @@ impl<'a> Iterator for FDE_Records<'a> {
        // Remove the length of the header and the content from the counter
        self.available -= length + mem::size_of::<u32>();
-        let mut next_fde_reader = self.reader.clone();
+        let mut next_fde_reader = DwarfReader::from_reader(&self.reader, false);
        next_fde_reader.offset(length as u32);
        let cie_ptr = self.reader.read_u32();
        let next_val = if cie_ptr != 0 {
            let pc_begin = read_encoded_pointer_with_pc(&mut self.reader, self.pointer_encoding)
                .expect("Failed to read PC Begin");
-            Some((pc_begin as u32, fde_addr))
+            Some((pc_begin as u32, self.reader.virt_addr))
        } else {
            None
        };
@ -440,7 +447,8 @@ impl<'a> EH_Frame_Hdr<'a> {
        writer.write_u8(0x3B); // table_enc - .eh_frame_hdr section-relative 4-byte signed value
        let eh_frame_offset = eh_frame_addr.wrapping_sub(
-            eh_frame_hdr_addr + writer.offset as u32);
+            eh_frame_hdr_addr + writer.offset as u32 + ((mem::size_of::<u8>() as u32) * 4),
        );
        writer.write_u32(eh_frame_offset); // eh_frame_ptr
        writer.write_u32(0); // `fde_count`, will be written in finalize_fde
--- a/nac3ld/src/lib.rs
+++ b/nac3ld/src/lib.rs
@ -1,4 +1,10 @@
-#![deny(future_incompatible, let_underscore, nonstandard_style, clippy::all)]
+#![deny(
    future_incompatible,
    let_underscore,
    nonstandard_style,
    rust_2024_compatibility,
    clippy::all
 )]
 #![warn(clippy::pedantic)]
 #![allow(
    clippy::cast_possible_truncation,
--- a/nac3parser/src/lib.rs
+++ b/nac3parser/src/lib.rs
@ -15,7 +15,13 @@
 //!
 //! ```
-#![deny(future_incompatible, let_underscore, nonstandard_style, clippy::all)]
+#![deny(
    future_incompatible,
    let_underscore,
    nonstandard_style,
    rust_2024_compatibility,
    clippy::all
 )]
 #![warn(clippy::pedantic)]
 #![allow(
    clippy::enum_glob_use,
@ -43,11 +49,11 @@ lalrpop_mod!(
        future_incompatible,
        let_underscore,
        nonstandard_style,
        rust_2024_compatibility,
        unused,
        clippy::all,
        clippy::pedantic
    )]
    #[warn(rust_2024_compatibility)]
    python
 );
 pub mod config_comment_helper;
--- a/nac3standalone/demo/src/globals.py
+++ b/nac3standalone/demo/src/globals.py
@ -7,7 +7,7 @@ def output_int64(x: int64):
    ...
 X: int32 = 0
-Y = int64(1)
+Y: int64 = int64(1)
 def f():
    global X, Y
--- a/nac3standalone/demo/src/ndarray.py
+++ b/nac3standalone/demo/src/ndarray.py
@ -144,7 +144,6 @@ def test_ndarray_array():
    # Copy
    n2_cpy: ndarray[float, 2] = np_array(n2, copy=False)
    output_ndarray_float_2(n2_cpy)
    n2_cpy.fill(0.0)
    output_ndarray_float_2(n2_cpy)
@ -1757,7 +1756,7 @@ def run() -> int32:
    test_ndarray_nextafter_broadcast_rhs_scalar()
    test_ndarray_transpose()
    test_ndarray_reshape()
-
+    
    test_ndarray_dot()
    test_ndarray_cholesky()
    test_ndarray_qr()
--- a/nac3standalone/src/main.rs
+++ b/nac3standalone/src/main.rs
@ -1,4 +1,10 @@
-#![deny(future_incompatible, let_underscore, nonstandard_style, clippy::all)]
+#![deny(
    future_incompatible,
    let_underscore,
    nonstandard_style,
    rust_2024_compatibility,
    clippy::all
 )]
 #![warn(clippy::pedantic)]
 #![allow(clippy::too_many_lines, clippy::wildcard_imports)]
@ -39,9 +45,8 @@ use nac3core::{
    },
 };
 use basic_symbol_resolver::*;
 mod basic_symbol_resolver;
 use basic_symbol_resolver::*;
 /// Command-line argument parser definition.
 #[derive(Parser)]
@ -169,49 +174,46 @@ fn handle_typevar_definition(
 fn handle_assignment_pattern(
    targets: &[Expr],
    value: &Expr,
-    resolver: Arc<dyn SymbolResolver + Send + Sync>,
+    resolver: &(dyn SymbolResolver + Send + Sync),
    internal_resolver: &ResolverInternal,
-    composer: &mut TopLevelComposer,
+    def_list: &[Arc<RwLock<TopLevelDef>>],
    unifier: &mut Unifier,
    primitives: &PrimitiveStore,
 ) -> Result<(), String> {
    if targets.len() == 1 {
-        let target = &targets[0];
+        match &targets[0].node {
        match &target.node {
            ExprKind::Name { id, .. } => {
                let def_list = composer.extract_def_list();
                let unifier = &mut composer.unifier;
                let primitives = &composer.primitives_ty;
                if let Ok(var) =
-                    handle_typevar_definition(value, &*resolver, &def_list, unifier, primitives)
+                    handle_typevar_definition(value, resolver, def_list, unifier, primitives)
                {
                    internal_resolver.add_id_type(*id, var);
                    Ok(())
-                } else if let Ok(val) = parse_parameter_default_value(value, &*resolver) {
+                } else if let Ok(val) = parse_parameter_default_value(value, resolver) {
                    internal_resolver.add_module_global(*id, val);
                    let (name, def_id, _) = composer
                        .register_top_level_var(
                            *id,
                            None,
                            Some(resolver.clone()),
                            "__main__",
                            target.location,
                        )
                        .unwrap();
                    internal_resolver.add_id_def(name, def_id);
                    Ok(())
                } else {
                    Err(format!("fails to evaluate this expression `{:?}` as a constant or generic parameter at {}",
-                        target.node,
+                        targets[0].node,
-                        target.location,
+                        targets[0].location,
                    ))
                }
            }
            ExprKind::List { elts, .. } | ExprKind::Tuple { elts, .. } => {
-                handle_assignment_pattern(elts, value, resolver, internal_resolver, composer)?;
+                handle_assignment_pattern(
                    elts,
                    value,
                    resolver,
                    internal_resolver,
                    def_list,
                    unifier,
                    primitives,
                )?;
                Ok(())
            }
-            _ => Err(format!("assignment to {target:?} is not supported at {}", target.location)),
+            _ => Err(format!(
                "assignment to {:?} is not supported at {}",
                targets[0], targets[0].location
            )),
        }
    } else {
        match &value.node {
@ -221,9 +223,11 @@ fn handle_assignment_pattern(
                        handle_assignment_pattern(
                            std::slice::from_ref(tar),
                            val,
-                            resolver.clone(),
+                            resolver,
                            internal_resolver,
-                            composer,
+                            def_list,
                            unifier,
                            primitives,
                        )?;
                    }
                    Ok(())
@ -244,9 +248,8 @@ fn handle_assignment_pattern(
 fn handle_global_var(
    target: &Expr,
    value: Option<&Expr>,
-    resolver: &Arc<dyn SymbolResolver + Send + Sync>,
+    resolver: &(dyn SymbolResolver + Send + Sync),
    internal_resolver: &ResolverInternal,
    composer: &mut TopLevelComposer,
 ) -> Result<(), String> {
    let ExprKind::Name { id, .. } = target.node else {
        return Err(format!(
@ -259,12 +262,8 @@ fn handle_global_var(
        return Err(format!("global variable `{id}` must be initialized in its definition"));
    };
-    if let Ok(val) = parse_parameter_default_value(value, &**resolver) {
+    if let Ok(val) = parse_parameter_default_value(value, resolver) {
        internal_resolver.add_module_global(id, val);
        let (name, def_id, _) = composer
            .register_top_level_var(id, None, Some(resolver.clone()), "__main__", target.location)
            .unwrap();
        internal_resolver.add_id_def(name, def_id);
        Ok(())
    } else {
        Err(format!(
@ -356,12 +355,17 @@ fn main() {
    for stmt in parser_result {
        match &stmt.node {
            StmtKind::Assign { targets, value, .. } => {
                let def_list = composer.extract_def_list();
                let unifier = &mut composer.unifier;
                let primitives = &composer.primitives_ty;
                if let Err(err) = handle_assignment_pattern(
                    targets,
                    value,
-                    resolver.clone(),
+                    resolver.as_ref(),
                    internal_resolver.as_ref(),
-                    &mut composer,
+                    &def_list,
                    unifier,
                    primitives,
                ) {
                    panic!("{err}");
                }
@ -371,12 +375,16 @@ fn main() {
                if let Err(err) = handle_global_var(
                    target,
                    value.as_ref().map(Box::as_ref),
-                    &resolver,
+                    resolver.as_ref(),
                    internal_resolver.as_ref(),
                    &mut composer,
                ) {
                    panic!("{err}");
                }
                let (name, def_id, _) = composer
                    .register_top_level(stmt, Some(resolver.clone()), "__main__", true)
                    .unwrap();
                internal_resolver.add_id_def(name, def_id);
            }
            // allow (and ignore) "from __future__ import annotations"
--- a/runkernel/src/main.rs
+++ b/runkernel/src/main.rs
@ -1,4 +1,10 @@
-#![deny(future_incompatible, let_underscore, nonstandard_style, clippy::all)]
+#![deny(
    future_incompatible,
    let_underscore,
    nonstandard_style,
    rust_2024_compatibility,
    clippy::all
 )]
 #![warn(clippy::pedantic)]
 #![allow(clippy::semicolon_if_nothing_returned, clippy::uninlined_format_args)]
@ -6,47 +12,47 @@ use std::env;
 static mut NOW: i64 = 0;
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn now_mu() -> i64 {
    unsafe { NOW }
 }
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn at_mu(t: i64) {
    unsafe { NOW = t }
 }
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn delay_mu(dt: i64) {
    unsafe { NOW += dt }
 }
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn rtio_init() {
    println!("rtio_init");
 }
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn rtio_get_counter() -> i64 {
    0
 }
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn rtio_output(target: i32, data: i32) {
    println!("rtio_output @{} target={target:04x} data={data}", unsafe { NOW });
 }
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn print_int32(x: i32) {
    println!("print_int32: {x}");
 }
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn print_int64(x: i64) {
    println!("print_int64: {x}");
 }
-#[unsafe(no_mangle)]
+#[no_mangle]
 pub extern "C" fn __nac3_personality(_state: u32, _exception_object: u32, _context: u32) -> u32 {
    unimplemented!();
 }