Search Results for "inference"

...While this also brings exciting new features along (like union types), first and foremost, it means that the type-system gets (even) less in your way and for instance type-inference and overload resolution are much improved. One underlying core concept of Scala was (and still is to some degree) to provide users with a small set of powerful features that can be combined to great (and sometimes even unforeseen) expressivity. For example, the feature of implicits has been used to model contextual abstraction, to express type-level computation, model type-classes, perform implicit coercions, encode extension methods, and many more. ...

Type inference provides robustness and correctness, but without the cost of additional code. Let the compiler catch bugs for you. Fable produces readable JavaScript code compatible with ES2015 standards and popular tooling like Webpack. Call JavaScript from Fable or Fable from JS. Use NPM packages. The entire JavaScript ecosystem is at your fingertips.

...OCaml’s powerful type system means more bugs are caught at compile-time, and large, complex codebases are easier to maintain. This makes it a good language for running critical code. At the same time, sophisticated inference makes the type system unobtrusive, creating a smooth developer experience. OCaml has two compilers. One is a bytecode compiler that generates small, portable executables and is very fast. The other is a native code compiler that produces more efficient machine code; its performance matches the highest standards of modern compilers. ...

Elm uses type inference to detect corner cases and give friendly hints. NoRedInk switched to Elm about four years ago, and 300k+ lines later, they still have not had to scramble to fix a confusing runtime exception in production. The compiler guides you safely through your changes, ensuring confidence even through the most wide-reaching refactorings in unfamiliar codebases.

FOML is an expressive logic rule language that supports object modeling, analysis, and inference. It naturally supports model-level activities, such as constraints (extending UML diagrams), dynamic compositional modeling, analysis and reasoning about models, model testing, design pattern modeling, specification of Domain Specific Modeling Languages, and meta-modeling. FOML can reason about: 1. The model meta-data (meta-model level reasoning, or syntax reasoning) 2.

...Gluon is a small, statically-typed, functional programming language designed for application embedding. Static typing makes it easier to write safe and efficient interfaces between gluon and the host application. Type inference ensures that types rarely have to be written explicitly giving all the benefits of static types with none of the typing. Marshalling values to and from gluon requires next to no boilerplate, allowing functions defined in Rust to be directly passed to gluon. Gluon supports Unicode out of the box with utf-8 encoded strings and Unicode codepoints as characters. ...

Kaya: A statically typed, imperative cross-platform programming language with type inference, powerful data description capabilities and built-in abstractions and libraries for easy and robust web application development. http://kayalang.org/

This is a framework for the creation of dynamic scripting languages on the .NET platform. Static typing, type inference, and true derivation from .NET classes are also planned. Two projects built on this are Boa and NetLisp. It is a work in progress.

RuleWorks is a rules-based application development tool providing the convenience of cross-platform development combined with one of the most powerful high level rules-based languages and fastest inference engine.

Stalin is an aggressive optimizing batch whole-program Scheme compiler. It uses advanced flow analysis and type inference and a variety of other optimization techniques to produce code (using C as an intermediate language) that is extremely fast.