Search Sciweavers | Sciweavers

632 search results - page 2 / 127

» Explicit Substitutions and Programming Languages

click to vote

B
1998
Springer

101views Software Engineering» more B 1998»

The Generalised Substitution Language Extended to Probabilistic Programs

13 years 10 months ago

Download www.cse.unsw.edu.au

Let predicate P be converted from Boolean to numeric type by writing P , with false being 0 and true being 1, so that in a degenerate sense P can be regarded as `the probability th...

Carroll Morgan

claim paper

Read More »

click to vote

LPAR
2004
Springer

127views Automated Reasoning» more LPAR 2004»

Second-Order Matching via Explicit Substitutions

13 years 11 months ago

Download www.mat.unb.br

Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...

Flávio L. C. de Moura, Fairouz Kamareddine,...

claim paper

Read More »

click to vote

POPL
2008
ACM

114views Programming Languages» more POPL 2008»

A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions

14 years 6 months ago

Download complogic.cs.mcgill.ca

Brigitte Pientka

claim paper

Read More »

click to vote

ESOP
2008
Springer

126views Programming Languages» more ESOP 2008»

Practical Programming with Higher-Order Encodings and Dependent Types

13 years 8 months ago

Download www.cs.yale.edu

Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...

Adam Poswolsky, Carsten Schürmann

claim paper

Read More »

click to vote

POPL
1993
ACM

91views Programming Languages» more POPL 1993»

Explicit Polymorphism and CPS Conversion

13 years 10 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers