Results 31 to 40 of about 13,083 (112)
Program equivalence for a concurrent lambda calculus with futures [PDF]
, 2006 Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with futures Lambda(fut), which formalizes the operational semantics of the ...
Niehren, Joachim +3 more
core +1 more source
A call-by-need lambda-calculus with locally bottom-avoiding choice: context lemma and correctness of transformations [PDF]
, 2006 We present a higher-order call-by-need lambda calculus enriched with constructors, case-expressions, recursive letrec-expressions, a seq-operator for sequential evaluation and a non-deterministic operator amb, which is locally bottom-avoiding.
Sabel, David, Schmidt-Schauß, Manfred
core
A Theory of Explicit Substitutions with Safe and Full Composition
, 2009 Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the first part of ...
Delia Kesner +4 more
core +2 more sources
Intersection types for unbind and rebind
, 2010 We define a type system with intersection types for an extension of lambda-calculus with unbind and rebind operators. In this calculus, a term with free variables, representing open code, can be packed into an "unbound" term, and passed around as a value.
Alain Frisch +30 more
core +1 more source
Recent Advances in Intelligent Source Code Generation: A Survey on Natural Language Based Studies. [PDF]
Entropy (Basel), 2021 Yang C, Liu Y, Yin C.
europepmc +1 more source
Adequacy of compositional translations for observational semantics [PDF]
, 2008 We investigate methods and tools for analysing translations between programming languages with respect to observational semantics. The behaviour of programs is observed in terms of may- and must-convergence in arbitrary contexts, and adequacy of ...
Niehren, Joachim +3 more
core +8 more sources
Probabilistic Operational Semantics for the Lambda Calculus
, 2011 Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values.
Lago, Ugo Dal, Zorzi, Margherita
core +3 more sources
How to prove similarity a precongruence in non-deterministic call-by-need lambda calculi [PDF]
, 2006 Extending the method of Howe, we establish a large class of untyped higher-order calculi, in particular such with call-by-need evaluation, where similarity, also called applicative simulation, can be used as a proof tool for showing contextual preorder ...
Mann, Matthias, Schmidt-Schauß, Manfred
core
Neural circuits and symbolic processing. [PDF]
Neurobiol Learn Mem, 2021 Do Q, Hasselmo ME.
europepmc +1 more source
Machine Learning Guidance for Connection Tableaux. [PDF]
J Autom Reason, 2021 Färber M, Kaliszyk C, Urban J.
europepmc +1 more source