<--- Back to Details
First PageDocument Content
Method / Object-oriented programming / Multiple dispatch / Dynamic dispatch / Visitor pattern / Polymorphism / Generic function / Typeof / This / Inheritance / Dispatch
Date: 2012-12-03 03:24:17
Method
Object-oriented programming
Multiple dispatch
Dynamic dispatch
Visitor pattern
Polymorphism
Generic function
Typeof
This
Inheritance
Dispatch

Multiple dispatch Axel Rauschmayer 2ality.com

Add to Reading List

Source URL: dl.2ality.com

Download Document from Source Website

File Size: 102,53 KB

Share Document on Facebook

Similar Documents

Search algorithms / Information retrieval / Information science / Cryptography / Hashing / Cryptographic hash functions / Error detection and correction / Hash function / Hash table / Hopf decomposition / Compound of twelve pentagonal antiprisms with rotational freedom

Time-memory Trade-offs for Near-collisions Ga¨etan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider o

DocID: 1xTVd - View Document

Software engineering / Computer programming / Declarative programming / Functional programming / Data types / Programming language comparisons / Type theory / Higher-order functions / Fold / Generic programming / Map / Type class

Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of

DocID: 1rghj - View Document

Algebra / Mathematics / Abstract algebra / Polynomials / Galois theory / Orthogonal polynomials / Field theory / Generic polynomial / Quintic function / Transcendental number / Elliptic curve / SturmLiouville theory

1 On the field isomorphism problem of generic polynomials via formal Tschirnhausen transformation Akinari Hoshi and Katsuya Miyake Let k be a field and G a finite group. A k-generic polynomial for G covers all G-Galo

DocID: 1qQKB - View Document

Abstract algebra / Algebra / Mathematics / Group theory / Discrete logarithm / Index calculus algorithm / PohligHellman algorithm / Baby-step giant-step / Limit of a function

A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany

DocID: 1qKpq - View Document

Estimation theory / Statistics / Statistical theory / Libart / Likelihood function / Maximum likelihood estimation / Confidence interval / Pell Grant / Score

SAS:SAS Graph Generic Driver

DocID: 1qmmk - View Document