Results 51 to 60 of about 80,039 (149)
Verified Subtyping with Traits and Mixins
, 2014 Traits allow decomposing programs into smaller parts and mixins are a form of composition that resemble multiple inheritance. Unfortunately, in the presence of traits, programming languages like Scala give up on subtyping relation between objects.
Sharma, Asankhaya
core +2 more sources
Session Type Inference in Haskell
, 2011 We present an inference system for a version of the Pi-calculus in Haskell for the session type proposed by Honda et al. The session type is very useful in checking if the communications are well-behaved.
Agusa, Kiyoshi, Imai, Keigo, Yuen, Shoji
core +2 more sources
Constraint Generation for the Jeeves Privacy Language [PDF]
, 2014 Our goal is to present a completed, semantic formalization of the Jeeves privacy language evaluation engine, based on the original Jeeves constraint semantics defined by Yang et al at POPL12, but sufficiently strong to support a first complete ...
Rose, Eva
core
User-friendly Support for Common Concepts in a Lightweight Verifier [PDF]
, 2010 Machine verification of formal arguments can only increase our confidence in the correctness of those arguments, but the costs of employing machine verification still outweigh the benefits for some common kinds of formal reasoning activities. As a result,
Lapets, Andrei
core +1 more source
Emotion Analysis of Cross-Media Writing Text in the Context of Big Data. [PDF]
Front Psychol, 2022 Ren R.
europepmc +1 more source
Parsley: optimising and improving parser combinators
, 2023 Parser combinators are a functional abstraction for parsing that abstracts hand-written recursive-descent parsers behind a high-level set of combinators. While these kinds of parsers are popular in the functional programming community, they have been historically criticised: * Parser combinator performance is sub-par compared with handwritten parsers. *
openaire +2 more sources
The computational origin of representation. [PDF]
Minds Mach (Dordr), 2021 Piantadosi ST.
europepmc +1 more source
Lightweight Formal Verification in Classroom Instruction of Reasoning about Functional Code [PDF]
, 1997 In college courses dealing with material that requires mathematical rigor, the adoption of a machine-readable representation for formal arguments can be advantageous.
Lapets, Andrei
core
Multi-dimensional Type Theory: Rules, Categories, and Combinators for Syntax and Semantics
, 2004 We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla.
Villadsen, Jørgen
core +2 more sources
Opportunities for a Truffle-based Golo Interpreter [PDF]
, 2015 Golo is a simple dynamically-typed language for the Java Virtual Machine. Initially implemented as a ahead-of-time compiler to JVM bytecode, it leverages invokedy-namic and JSR 292 method handles to implement a reasonably efficient runtime.
Loiseau, Yannick +3 more
core +2 more sources