Résultats
56 articlesTrier
18:27EN
AI Engineer· 26 oct. 2026Daksh Gupta on Building a Better AI Code Review AgentDaksh Gupta · GreptileGreptile co-founder Daksh Gupta explains why a webhook plus a coding agent is not enough for reliable pull-request review—and how targeted prompts, incident data, model inversion, codebase context, browser testing, and task-specific model routing can help.
1:02ENFrom Punched Cards to AI Software FactoriesMatthew Berman · Forward FutureMatthew Berman contrasts early programming with an AI-assisted workflow and promotes Factory’s development tools.
17:37ENAI Coding, Game Mashups and the Value of Human TasteMatthew Berman · Forward FutureMatthew Berman explains decompilation and game mashups, then argues that iterative AI coding changes software and creativity.
17:03ENDeepSWE: Testing Coding Agents on Longer Software TasksMatthew Berman · Forward FutureMatthew Berman reviews Datacurve’s benchmark, its verifier audit and the tradeoffs of comparing models under a shared harness.
1:08ENWill AI Change What Programmers Do?Matthew Berman · Forward FutureMatthew Berman responds to Ryan Dahl's prediction about writing code and argues that systems thinking will remain important.
1:20:57ENMatt Godbolt: Inside Skylake’s Out-of-Order PipelineMatt GodboltA guided tour of instruction decoding, register renaming, execution and memory ordering, grounded in reverse engineering and careful measurements.
52:05ENCorwin de Zahr: Exploring OCaml Runtime Safety Through a CTF ChallengeCorwin de Zahr · Jane StreetA deliberately restricted OCaml sandbox becomes a way to examine type safety, callbacks, memory representation and binary debugging.
47:08ENChris Casinghino on Making OCaml Safe for Performance EngineeringChris Casinghino · Jane StreetJane Street’s OCaml extensions use layouts and modes to offer more control over memory and parallelism while preserving safety and familiar programming patterns.
12:43ENHow OCaml Represents Values in MemoryA practical tour of immediate integers, heap blocks, runtime tags and variant constructors, illustrated with OCaml's Obj module.
27:16ENTudor Brindus on Finding and Reducing System JitterTudor Brindus · Jane StreetA memory ping-pong benchmark reveals how virtualization, interrupts, CPU frequency changes and speculation can disrupt low-latency systems.
9:25ENRichard Eisenberg: Using OCaml’s Coercion OperatorRichard Eisenberg · Jane StreetA practical tour of subtyping, polymorphic variants and private type abbreviations, with no runtime conversion cost.
8:06ENHow OCaml's Proposed Include Functor Syntax Reduces RepetitionA reverse-array example shows how to derive common module functions from a minimal implementation without an extra wrapper module.
14:36ENProgramming with OCaml's Local ModeAn example shows how a local list can contain global values, why a non-escaping annotation alone does not ensure stack allocation, and where the experimental feature remains awkward.
11:28ENOCaml Local Types: Regional Parameters and Loop RegionsA demonstration explains why some local parameters can cross a function boundary and how loop regions reclaim allocations.
9:14ENOCaml Local Function Types: Why Partial Application Can EscapeRichard Eisenberg · Jane StreetRichard Eisenberg uses a list-append example to show how a local argument changes the mode of a partially applied function in Jane Street’s OCaml compiler branch.
15:59ENTail Calls and Local Regions in OCamlA list-counting example reveals why a local closure can escape at a tail call, and how regional mode and [@nontail] affect the result.
14:23ENTesting DBRX: Coding Strengths and Reasoning GapsMatthew Berman · Forward FutureMatthew Berman examines Databricks’ open-weight model and puts it through coding, arithmetic and reasoning prompts.
3:30ENRichard Eisenberg on Jane Street's OCaml ExperimentsRichard Eisenberg · Jane StreetJane Street's compiler team is exploring unboxed types, locality modes, and data-race-free parallelism to make OCaml's performance and memory management better suited to its needs.
11:07ENHow OCaml Locals Use a Separate StackA list example shows how region-scoped local values can avoid repeated garbage-collected allocations.
23:25ENRichard Eisenberg: How OCaml Locals Reduce Garbage-Collected AllocationRichard Eisenberg · Jane StreetAn annotated list-processing example shows why locality must be preserved both when values are created and when functions consume them.
22:27ENHow OCaml Infers LocalityA look at local and global mode inference, module signatures, mode crossing for integers, and conversions between function types.
15:17ENOCaml Locals, Modes, and SubmodingA worked explanation of how local and global modes control escaping values, and how those modes interact with function types.
12:52ENOCaml Local Variables, Return Values and RegionsA worked example shows how `local_` and `exclave_` let a function accept a local value and return a local structure in its caller's region.
8:52ENIntroducing Local Parameters in OCamlA demonstration of how Jane Street's experimental local mode restricts escaping values and makes function interfaces easier to reason about.
Charger plus24 sur 56 affichés