Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Simply typed lambda calculus (view)

searching for Typed lambda calculus 15 found (95 total)

Generalized quantifier (1,504 words) [view diff] no match in snippet view article find links to article

In formal semantics, a generalized quantifier (GQ) is an expression that denotes a set of sets. This is the standard semantics assigned to quantified noun

Kappa calculus (1,771 words) [view diff] exact match in snippet view article find links to article

be regarded as "a reformulation of the first-order fragment of typed lambda calculus". Because its functions are not first-class objects, evaluation

Logical framework (965 words) [view diff] exact match in snippet view article find links to article

treatment of syntax, rules and proofs by means of a dependently typed lambda calculus. Syntax is treated in a style similar to, but more general than

List of formal systems (284 words) [view diff] exact match in snippet view article find links to article

Kappa calculus, a reformulation of the first-order fragment of typed lambda calculus Rho calculus, introduced as a general means to uniformly integrate

Dialgebra (275 words) [view diff] exact match in snippet view article find links to article

doi:10.1051/ita:1999126. MR 1748664. Hagino, Tatsuya (1987). "A typed lambda calculus with categorical type constructors". In Pitt, David H.; Poigné,

Anti-unification (3,058 words) [view diff] exact match in snippet view article find links to article

Simply typed lambda calculus (Input: Terms in the eta-long beta-normal form. Output: Various fragments of the simply typed lambda calculus including

Arnon Avron (541 words) [view diff] exact match in snippet view article find links to article

Arnon; Honsell, Furio; Mason, Ian A.; Pollack, Robert (1992). "Using typed lambda calculus to implement formal systems on a machine". Journal of Automated

Proof assistant (1,206 words) [view diff] exact match in snippet view article find links to article

TPS and ETPS – Interactive theorem provers also based on simply typed lambda calculus, but based on an independent formulation of the logical theory and

List of PSPACE-complete problems (1,807 words) [view diff] exact match in snippet view article find links to article

satisfiability and model checking Type inhabitation problem for simply typed lambda calculus Integer circuit evaluation Word problem for linear bounded automata

Canonical form (1,895 words) [view diff] exact match in snippet view article find links to article

(\lambda x.(xx)\;\lambda x.(xx))} does not have a normal form. In the typed lambda calculus, every well-formed term can be rewritten to its normal form. In

Refocusing (semantics) (2,786 words) [view diff] exact match in snippet view article

sequent calculus, for deriving interpretations of the gradually-typed lambda calculus, and for full reduction. Danvy and Nielsen stated conditions for

Randomized algorithm (4,218 words) [view diff] case mismatch in snippet view article find links to article

Algorithms, pp. 91–122. Dirk Draheim. "Semantics of the Probabilistic Typed Lambda Calculus (Markov Chain Semantics, Termination Behavior, and Denotational

Dynamic syntax (1,434 words) [view diff] exact match in snippet view article find links to article

semantic formulae and composition calculus (epsilon calculus within typed lambda calculus), trees (lambda application ordering), and tree building actions

Quantum programming (4,217 words) [view diff] exact match in snippet view article find links to article

programming language. In 2004, Selinger and Valiron defined a strongly typed lambda calculus for quantum computation with a type system based on linear logic

Unification (computer science) (7,390 words) [view diff] no match in snippet view article

Waterloo, 1972) Gérard Huet: (1 June 1975) A Unification Algorithm for typed Lambda-Calculus, Theoretical Computer Science Gérard Huet: Higher Order Unification