Explaining the Lazy Krivine Machine Using Explicit Substitution and Addresses

Higher-Order and Symbolic Computation
doi 10.1007/s10990-007-9013-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Providing High Availability Using Lazy Replication

ACM Transactions on Computer Systems
Computer Science
1992English

Semantics of Lazy Evaluation Using the Two-Level Grammar

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2008English

Enforcing Email Addresses Privacy Using Tokens

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

SAT-Based Compositional Verification Using Lazy Learning

English

Explicit Cross-Lingual Pre-Training for Unsupervised Machine Translation

2019English

Multi-Engine Machine Translation Guided by Explicit Word Matching

2005English

Using Arguments for Making and Explaining Decisions

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2009English

The Addresses in Medicine and Surgery

BMJ
1866English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy